Tag #word
847 papers:
- CSL-2020-Jez #equation #problem #unification
- Solving Word Equations (And Other Unification Problems) by Recompression (Invited Talk) (AJ), p. 17.
- EDM-2019-JoYKL #analysis #comparative #education #effectiveness #learning #online
- A Comparative Analysis of Emotional Words for Learning Effectiveness in Online Education (JJ, YY, GK, HL).
- MSR-2019-BiswasVP #analysis #re-engineering #sentiment
- Exploring word embedding techniques to improve sentiment analysis of software engineering texts (EB, KVS, LLP), pp. 68–78.
- DLT-2019-BroughCP #context-free grammar #problem
- Context-Free Word Problem Semigroups (TB, AJC, MP), pp. 292–305.
- DLT-2019-DayFMN
- k-Spectra of Weakly-c-Balanced Words (JDD, PF, FM, DN), pp. 265–277.
- DLT-2019-KariRV #automaton #finite #rank
- Words of Minimum Rank in Deterministic Finite Automata (JK, AR, AV), pp. 74–87.
- DLT-2019-Lejeune0R #complexity
- Computing the k-binomial Complexity of the Thue-Morse Word (ML, JL0, MR), pp. 278–291.
- DLT-2019-Saarela
- Separating Many Words by Counting Occurrences of Factors (AS), pp. 251–264.
- AIIDE-2019-BehroozRJ #matter #quality #using
- Story Quality as a Matter of Perception: Using Word Embeddings to Estimate Cognitive Interest (MB, JR, AJ), pp. 3–9.
- CoG-2019-RajalingamS #adaptation #game studies
- Neuroevolution Strategies for Word Embedding Adaptation in Text Adventure Games (VRR, SS), pp. 1–8.
- CIKM-2019-KhabiriGVPM #classification #industrial
- Industry Specific Word Embedding and its Application in Log Classification (EK, WMG, BV, DP, PM), pp. 2713–2721.
- CIKM-2019-WangA0 #documentation
- Beyond word2vec: Distance-graph Tensor Factorization for Word and Document Embeddings (SW, CCA, HL0), pp. 1041–1050.
- CIKM-2019-ZhangLZZLWCZ #learning
- Learning Chinese Word Embeddings from Stroke, Structure and Pinyin of Characters (YZ, YL, JZ, ZZ, XL, WW, ZC, SZ), pp. 1011–1020.
- ECIR-p1-2019-AlmasianSG
- Word Embeddings for Entity-Annotated Texts (SA, AS, MG), pp. 307–322.
- ECIR-p1-2019-HofstatterRLEH #retrieval
- Enriching Word Embeddings for Patent Retrieval with Global Context (SH, NR, ML, CE, AH), pp. 810–818.
- ECIR-p2-2019-BarmanDAA
- It's only Words and Words Are All I Have (MPB, KD, AA, AA), pp. 30–36.
- ECIR-p2-2019-ImaniVMS19a #network #query #using
- Deep Neural Networks for Query Expansion Using Word Embeddings (AI, AV, AM, AS), pp. 203–210.
- ECIR-p2-2019-MoussetPT #towards
- Towards Spatial Word Embeddings (PM, YP, LT), pp. 53–61.
- ICML-2019-AllenH #comprehension #towards
- Analogies Explained: Towards Understanding Word Embeddings (CA, TMH), pp. 223–231.
- ICML-2019-BrunetAAZ #bias #comprehension
- Understanding the Origins of Bias in Word Embeddings (MEB, CAH, AA, RSZ), pp. 803–811.
- ICML-2019-GultchinPBSK
- Humor in Word Embeddings: Cockamamie Gobbledegook for Nincompoops (LG, GP, NB, NS, AK), pp. 2474–2483.
- KDD-2019-FeiTL #learning #multi #predict
- Hierarchical Multi-Task Word Embedding Learning for Synonym Prediction (HF, ST, PL0), pp. 834–842.
- KDD-2019-YaoYX #semantics
- Enhancing Domain Word Embedding via Latent Semantic Imputation (SY, DY, KX), pp. 557–565.
- CASE-2019-XuMZLKZ #adaptation #learning
- An Adaptive Wordpiece Language Model for Learning Chinese Word Embeddings (BX, LM, LZ, HL, QK, MZ), pp. 812–817.
- CADE-2019-AnantharamanHNR #equation #unification
- Unification Modulo Lists with Reverse Relation with Certain Word Equations (SA, PH, PN, MR), pp. 1–17.
- CADE-2019-FurbachKS #axiom
- Names Are Not Just Sound and Smoke: Word Embeddings for Axiom Selection (UF, TK, CS), pp. 250–268.
- JCDL-2018-BunkK #modelling #named #topic
- WELDA: Enhancing Topic Models by Incorporating Local Word Context (SB, RK), pp. 293–302.
- MSR-2018-EfstathiouCS #re-engineering
- Word embeddings for the software engineering domain (VE, CC, DS), pp. 38–41.
- DLT-2018-CartonP #theorem
- Simon's Theorem for Scattered Words (OC, MP), pp. 182–193.
- DLT-2018-GiancarloMRRS #sorting
- Block Sorting-Based Transformations on Words: Beyond the Magic BWT (RG, GM, AR, GR, MS), pp. 1–17.
- DLT-2018-Michielini #finite #first-order #logic #problem
- Uniformization Problem for Variants of First Order Logic over Finite Words (VM), pp. 516–528.
- CIKM-2018-Jatowt0BTD #evolution #interactive #visualisation
- Every Word has its History: Interactive Exploration and Visualization of Word Sense Evolution (AJ, RC0, SSB, NT, AD), pp. 1899–1902.
- CIKM-2018-KhattarKV018a #3d #network #recommendation
- Weave&Rec: A Word Embedding based 3-D Convolutional Network for News Recommendation (DK, VK, VV, MG0), pp. 1855–1858.
- CIKM-2018-RoleMN #algorithm #clustering #evaluation #using
- Unsupervised Evaluation of Text Co-clustering Algorithms Using Neural Word Embeddings (FR, SM, MN), pp. 1827–1830.
- CIKM-2018-RoyGBBM #how #information retrieval #normalisation #performance #using
- Using Word Embeddings for Information Retrieval: How Collection and Term Normalization Choices Affect Performance (DR, DG, SB, SB, MM), pp. 1835–1838.
- ECIR-2018-YangOMMF #linear #on the
- On the Reproducibility and Generalisation of the Linear Transformation of Word Embeddings (XY0, IO, RM, CM, AF), pp. 263–275.
- ECIR-2018-ZhangGL0C18a #documentation #representation
- Aggregating Neural Word Embeddings for Document Representation (RZ, JG, YL, JX0, XC), pp. 303–315.
- ICML-2018-ZhaoDBZ #learning #topic
- Inter and Intra Topic Structure Learning with Word Embeddings (HZ, LD, WLB, MZ), pp. 5887–5896.
- ICPR-2018-0004BWS #distance
- Improve Word Mover's Distance with Part-of-Speech Tagging (XC0, LB, DW, JS), pp. 3722–3728.
- ICPR-2018-BhuniaBBKB0P18a #generative #image #network #using
- Word Level Font-to-Font Image Translation using Convolutional Recurrent Generative Adversarial Networks (AKB, AKB, PB, AK, AB, PPR0, UP0), pp. 3645–3650.
- ICPR-2018-CortesCC #encoding #recognition #visual notation
- A new bag of visual words encoding method for human action recognition (XC, DC, HC), pp. 2480–2485.
- ICPR-2018-WeiZG #constraints #documentation #image #keyword #representation #visual notation
- Word Image Representation Based on Visual Embeddings and Spatial Constraints for Keyword Spotting on Historical Documents (HW, HZ0, GG), pp. 3616–3621.
- JCDL-2017-ElekesSB #modelling #on the #semantics #similarity
- On the Various Semantics of Similarity in Word Embedding Models (AE, MS, KB), pp. 139–148.
- CSEET-2017-JoL #case study #detection #education #keyword #re-engineering #video
- A Study of Keywords Based on the Word Frequency Effect Theory in Video Lectures of Software Engineering Education for Detecting Mind (JJ, HL), pp. 241–245.
- EDM-2017-NamFC #learning #predict #semantics
- Predicting Short- and Long-Term Vocabulary Learning via Semantic Features of Partial Word Knowledge (SN, GAF, KCT).
- AFL-2017-BeckerBSFW #set
- Unavoidable Sets of Partial Words of Uniform Length (JB, FBS, LF, SW), pp. 26–40.
- AFL-2017-BlanchetSadriCH
- Dyck Words, Lattice Paths, and Abelian Borders (FBS, KC, KH), pp. 56–70.
- AFL-2017-BlanchetSadriO
- Constructing Words with High Distinct Square Densities (FBS, SO), pp. 71–85.
- DLT-2017-BondtDZ
- DFAs and PFAs with Long Shortest Synchronizing Word Length (MdB, HD, HZ), pp. 122–133.
- DLT-2017-PetrovaS #on the
- On the Tree of Binary Cube-Free Words (EAP, AMS), pp. 296–307.
- DLT-2017-Richomme #infinity
- A Characterization of Infinite LSP Words (GR), pp. 320–331.
- DLT-2017-Rowland
- Binomial Coefficients, Valuations, and Words (ER), pp. 68–74.
- DLT-2017-Rukavicka #on the
- On the Number of Rich Words (JR), pp. 345–352.
- CHI-PLAY-2017-NazareHSR #how
- Bilingual SpeechBlocks: Investigating How Bilingual Children Tinker with Words in English and Spanish (JN, AH, IS, DR), pp. 183–193.
- CIKM-2017-AzarbonyadDBAMK #semantics
- Words are Malleable: Computing Semantic Shifts in Political and Media Discourse (HA, MD0, KB, AA, MM, JK), pp. 1509–1518.
- CIKM-2017-ChaGK #assessment #clustering #modelling #readability
- Language Modeling by Clustering with Word Embeddings for Text Readability Assessment (MC, YG, HTK), pp. 2003–2006.
- CIKM-2017-CristoHCLP #modelling #performance #recognition
- Fast Word Recognition for Noise channel-based Models in Scenarios with Noise Specific Domain Knowledge (MC, RH, ALdCC, FAL, MdGCP), pp. 607–616.
- CIKM-2017-DasMBS #using
- Estimating Event Focus Time Using Neural Word Embeddings (SD, AM, KB, VS), pp. 2039–2042.
- CIKM-2017-LeeYHC #metric #ontology #semantics
- Structural-fitting Word Vectors to Linguistic Ontology for Semantic Relatedness Measurement (YYL, TYY, HHH, HHC), pp. 2151–2154.
- CIKM-2017-RoyGGG #microblog
- Combining Local and Global Word Embeddings for Microblog Stemming (AR, TG, KG, SG0), pp. 2267–2270.
- ECIR-2017-BasuRGBG #approach #microblog #novel #retrieval
- A Novel Word Embedding Based Stemming Approach for Microblog Retrieval During Disasters (MB, AR, KG, SB, SG0), pp. 589–597.
- ECIR-2017-ChellalBD #similarity #twitter
- Word Similarity Based Model for Tweet Stream Prospective Notification (AC, MB, BD), pp. 655–661.
- ECIR-2017-ManotumruksaMO #matrix #network #predict #rating #social
- Matrix Factorisation with Word Embeddings for Rating Prediction on Location-Based Social Networks (JM, CM, IO), pp. 647–654.
- ECIR-2017-McDonaldMO #classification #semantics #using
- Enhancing Sensitivity Classification with Semantic Features Using Word Embeddings (GM, CM, IO), pp. 450–463.
- ECIR-2017-RekabsazLH #nondeterminism #similarity
- Exploration of a Threshold for Similarity Based on Uncertainty in Word Embedding (NR, ML, AH), pp. 396–409.
- ICML-2017-BamlerM
- Dynamic Word Embeddings (RB, SM), pp. 380–389.
- KDD-2017-XunLGZ #coordination #topic
- Collaboratively Improving Topic Discovery and Word Embeddings by Coordinating Global and Local Contexts (GX, YL, JG0, AZ), pp. 535–543.
- EDM-2016-CaiLHG #documentation #question
- Can Word Probabilities from LDA be Simply Added up to Represent Documents? (ZC, HL, XH, AG), pp. 577–578.
- ICPC-2016-SunSYL #named #source code
- WB4SP: A tool to build the word base for specific programs (WS, XS, HY, BL0), pp. 1–3.
- SANER-2016-ChenGX #category theory #library #mining #relational
- Mining Analogical Libraries in Q&A Discussions - Incorporating Relational and Categorical Knowledge into Word Embedding (CC, SG, ZX), pp. 338–348.
- DLT-2016-EndrullisKKS #infinity
- Degrees of Infinite Words, Polynomials and Atoms (JE, JK, JWK, AS), pp. 164–176.
- DLT-2016-GasnikovS
- Ternary Square-Free Partial Words with Many Wildcards (DG, AMS), pp. 177–189.
- DLT-2016-ManeaNS #equation #on the #problem #strict
- On the Solvability Problem for Restricted Classes of Word Equations (FM, DN, MLS), pp. 306–318.
- DLT-2016-NowotkaS #equation
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (DN, AS), pp. 332–343.
- CIKM-2016-DehghaniAKHM #modelling
- Luhn Revisited: Significant Words Language Models (MD0, HA, JK, DH, MM), pp. 1301–1310.
- CIKM-2016-EbrahimiD #personalisation #semantics
- Personalized Semantic Word Vectors (JE, DD), pp. 1925–1928.
- CIKM-2016-GhoshCCBR #approach
- Characterizing Diseases from Unstructured Text: A Vocabulary Driven Word2vec Approach (SG, PC, EC, JSB, NR), pp. 1129–1138.
- CIKM-2016-GuoFAC16a #information retrieval #semantics
- Semantic Matching by Non-Linear Word Transportation for Information Retrieval (JG, YF, QA, WBC), pp. 701–710.
- CIKM-2016-KuziSK #query #using
- Query Expansion Using Word Embeddings (SK, AS, OK), pp. 1929–1932.
- CIKM-2016-LiSLNF #classification #knowledge base #named #topic #twitter
- TweetSift: Tweet Topic Classification Based on Entity Knowledge Base and Topic Enhanced Word Embedding (QL, SS, XL, AN, RF), pp. 2429–2432.
- CIKM-2016-LiXSM #approach #documentation #effectiveness #topic
- Effective Document Labeling with Very Few Seed Words: A Topic Model Approach (CL, JX, AS, ZM), pp. 85–94.
- CIKM-2016-MengLLS #framework #representation
- Skipping Word: A Character-Sequential Representation based Framework for Question Answering (LM, YL, ML, PS), pp. 1869–1872.
- CIKM-2016-MouJXL0J #approach #encoding
- Distilling Word Embeddings: An Encoding Approach (LM, RJ, YX, GL, LZ0, ZJ), pp. 1977–1980.
- CIKM-2016-OrdentlichYFCGD #distributed #scalability
- Network-Efficient Distributed Word2vec Training System for Large Vocabularies (EO, LY, AF, PC, MG, ND, VR, GO), pp. 1139–1148.
- CIKM-2016-RoyGMJ #composition #estimation #feedback #kernel #using
- Word Vector Compositionality based Relevance Feedback using Kernel Density Estimation (DR, DG, MM, GJFJ), pp. 1281–1290.
- CIKM-2016-Wu0XTL #named #recommendation #using
- Tag2Word: Using Tags to Generate Words for Content Based Tag Recommendation (YW, YY0, FX0, HT, JL0), pp. 2287–2292.
- CIKM-2016-ZhangMZ #parametricity #topic
- A Non-Parametric Topic Model for Short Texts Incorporating Word Coherence Knowledge (YZ, WM, DDZ), pp. 2017–2020.
- ECIR-2016-JurgovskyGS #memory management #performance #robust
- Evaluating Memory Efficiency and Robustness of Word Embeddings (JJ, MG, CS), pp. 200–211.
- ECIR-2016-MustoSGL #learning #recommendation #wiki
- Learning Word Embeddings from Wikipedia for Content-Based Recommender Systems (CM, GS, MdG, PL), pp. 729–734.
- ICPR-2016-LiuKWK #classification #recognition
- Scene text recognition with CNN classifier and WFST-based word labeling (XL, TK, XW, KK), pp. 3999–4004.
- ICPR-2016-MaLW #database #online #recognition
- A new database for online handwritten Mongolian word recognition (LLM, JL, JW0), pp. 1131–1136.
- ICPR-2016-PassalisT #embedded #learning #retrieval
- Bag of Embedded Words learning for text retrieval (NP, AT), pp. 2416–2421.
- ICPR-2016-RichterLB #automation #visual notation
- Knowing when you don't: Bag of visual words with reject option for automatic visual inspection of bulk materials (MR0, TL, JB), pp. 3079–3084.
- ICPR-2016-StunerCP #network #recognition
- Cascading BLSTM networks for handwritten word recognition (BS, CC0, TP), pp. 3416–3421.
- ICPR-2016-XuLHWLWHC #3d #image #multi #retrieval #using
- Bag of temporal co-occurrence words for retrieval of focal liver lesions using 3D multiphase contrast-enhanced CT images (YX, LL, HH, DW, YL, JW0, XHH, YWC), pp. 2282–2287.
- KDD-2016-KimMJO #how #modelling #online
- How to Compete Online for News Audience: Modeling Words that Attract Clicks (JHK, AM, AJ, AHO), pp. 1645–1654.
- POPL-2016-LinB #equation #logic #string #towards #transducer
- String solving with word equations and transducers: towards a logic for analysing mutation XSS (AWL, PB), pp. 123–136.
- ICSE-2016-YeSMBL #documentation #information retrieval #re-engineering
- From word embeddings to document similarities for improved information retrieval in software engineering (XY0, HS, XM, RCB, CL0), pp. 404–415.
- CSL-2016-Kieronski #logic
- One-Dimensional Logic over Words (EK), p. 15.
- DocEng-2015-MeiKYRIMM #performance
- Efficient Computation of Co-occurrence Based Word Relatedness (JM, XK, ZY, ARC, AI, AM, EEM), pp. 43–46.
- DRR-2015-BideaultMCP #architecture #regular expression #using
- Spotting handwritten words and REGEX using a two stage BLSTM-HMM architecture (GB, LM, CC, TP).
- DRR-2015-SitaramHPSK #recognition #using
- Offline handwritten word recognition using MQDF-HMMs (RS, MH, AP, DS, SK).
- HT-2015-SongFGWCZ #graph #microblog
- Build Emotion Lexicon from Microblogs by Combining Effects of Seed Words and Emoticons in a Heterogeneous Graph (KS, SF, WG, DW, LC, CZ), pp. 283–292.
- EDM-2015-AllenM #modelling #natural language #student
- You are your words: Modeling Students' Vocabulary Knowledge with Natural Language Processing Techniques (LKA, DSM), pp. 258–265.
- EDM-2015-GandhiBD #education #topic #using #visual notation
- Topic Transition in Educational Videos Using Visually Salient Words (AG, AB, OD), pp. 289–296.
- EDM-2015-JohnPM #detection #graph #problem #question #semantics #similarity
- Semantic Similarity Graphs of Mathematics Word Problems: Can Terminology Detection Help? (RJLJ, RJP, TSM), pp. 452–455.
- EDM-2015-LuoSMG #predict #student #using
- Predicting Student Grade based on Free-style Comments using Word2Vec and ANN by Considering Prediction Results Obtained in Consecutive Lessons (JL, SES, TM, KG), pp. 396–399.
- EDM-2015-MostowGEG #automation #identification #learning
- Automatic Identification of Nutritious Contexts for Learning Vocabulary Words (JM, DG, RE, RG), pp. 266–273.
- EDM-2015-Olivares-Rodriguez #learning #mining #student
- Learning the Creative Potential of Students by Mining a Word Association Task (COR, MG), pp. 400–403.
- SCAM-2015-LawrieB #navigation #source code
- Navigating source code with words (DL, DB), pp. 71–80.
- CIAA-J-2013-BalkanskiBKW15 #complexity #on the
- On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
- CIAA-J-2013-DebarbieuxGNSZ15 #automaton #query #xml #xpath
- Early nested word automata for XPath query answering on XML streams (DD, OG, JN, TS, MZ), pp. 100–125.
- CIAA-2015-HoffmannS #infinity #metric
- Subword Metrics for Infinite Words (SH, LS), pp. 165–175.
- DLT-2015-Blanchet-SadriR
- Squareable Words (FBS, AR), pp. 132–142.
- DLT-2015-BoassonC
- Transfinite Lyndon Words (LB, OC), pp. 179–190.
- DLT-2015-FengLQ
- Path Checking for MTL and TPTL over Data Words (SF, ML, KQ), pp. 326–339.
- DLT-2015-JeckerF #multi
- Multi-sequential Word Relations (IJ, EF), pp. 288–299.
- DLT-2015-MasakovaPS
- Interval Exchange Words and the Question of Hof, Knill, and Simon (ZM, EP, SS), pp. 377–388.
- ICALP-v2-2015-Finkel #automaton #infinity #scalability #theorem
- Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (OF), pp. 222–233.
- LATA-2015-BadkobehFL #on the
- On the Number of Closed Factors in a Word (GB, GF, ZL), pp. 381–390.
- LATA-2015-HadravovaH #equation
- Equation xⁱyʲxᵏ=uⁱvʲuᵏ in Words (JH, SH), pp. 414–423.
- LATA-2015-MakowskyL #graph #matrix
- Hankel Matrices: From Words to Graphs (JAM, NL), pp. 47–55.
- LATA-2015-MikulskiPR #commutative
- Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.
- LATA-2015-NayakK #on the
- On the Language of Primitive Partial Words (ACN, KK), pp. 436–445.
- LATA-2015-VorelR #complexity
- Complexity of Road Coloring with Prescribed Reset Words (VV, AR), pp. 161–172.
- CHI-PLAY-2015-Barlet
- A Frank Conversation about the “F” Word (MCB), p. 1.
- FDG-2015-AarsethC #game studies #ontology
- The Word Game: The ontology of an undefinable object (EA, GC).
- FDG-2015-LevySMWLG #behaviour #difference #game studies
- Actions Speak Louder Than Words: An exploration of game play behavior and results from traditional assessments of individual differences (LML, RS, JM, JW, RL, MG).
- LCT-2015-BajajHKPSDY #question
- Audio Cues: Can Sound Be Worth a Hundred Words? (JB, AH, AK, RMP, KS, OD, KY), pp. 14–23.
- LCT-2015-ShimizuO #design #implementation #learning #novel
- Design and Implementation of Novel Word Learning System “Überall” (RS, KO), pp. 148–159.
- CIKM-2015-KenterR #similarity
- Short Text Similarity with Word Embeddings (TK, MdR), pp. 1411–1420.
- CIKM-2015-WangSN
- Enhanced Word Embeddings from a Hierarchical Neural Language Model (XW, KS, MN), pp. 1927–1930.
- ICML-2015-GouwsBC #distributed #named #performance
- BilBOWA: Fast Bilingual Distributed Representations without Word Alignments (SG, YB, GC), pp. 748–756.
- ICML-2015-KusnerSKW #documentation
- From Word Embeddings To Document Distances (MJK, YS, NIK, KQW), pp. 957–966.
- ICML-2015-TraskGR #modelling #order #scalability
- Modeling Order in Neural Word Embeddings at Scale (AT, DG, MR), pp. 2266–2275.
- ICML-2015-YogatamaFDS #learning
- Learning Word Representations with Hierarchical Sparse Coding (DY, MF, CD, NAS), pp. 87–96.
- SIGIR-2015-Bravo-MarquezFP #twitter
- From Unlabelled Tweets to Twitter-specific Opinion Words (FBM, EF, BP), pp. 743–746.
- SIGIR-2015-GangulyRMJ #information retrieval
- Word Embedding based Generalized Language Model for Information Retrieval (DG, DR, MM, GJFJ), pp. 795–798.
- SIGIR-2015-VulicM #information retrieval #modelling
- Monolingual and Cross-Lingual Information Retrieval Models Based on (Bilingual) Word Embeddings (IV, MFM), pp. 363–372.
- SAC-2015-PedrosaT #approach #encoding #visual notation
- Compact and discriminative approach for encoding spatial-relationship of visual words (GVP, AJMT), pp. 92–95.
- CSL-2015-KuskeLM #decidability #infinity #monad
- Infinite and Bi-infinite Words with Decidable Monadic Theories (DK, JL, AM), pp. 472–486.
- DRR-2014-KleberDS #classification #retrieval #using
- Form classification and retrieval using bag of words with shape features of line structures (FK, MD, RS), pp. 902107–9.
- JCDL-2014-JatowtD #framework #semantics
- A framework for analyzing semantic change of words across time (AJ, KD), pp. 229–238.
- JCDL-2014-MorenoD #clustering #induction #web
- PageRank-based Word Sense Induction within Web Search Results Clustering (JGM, GD), pp. 465–466.
- CSMR-WCRE-2014-TianLL #automation #database #similarity
- Automated construction of a software-specific word similarity database (YT, DL, JLL), pp. 44–53.
- DLT-J-2013-BonomoMRRS14 #multi #sorting
- Sorting conjugates and Suffixes of Words in a Multiset (SB, SM, AR, GR, MS), p. 1161–?.
- DLT-J-2013-GocRRS14 #automation #on the
- On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving) (DG, NR, MR, PS), pp. 1097–1110.
- AFL-2014-CarapelleFGQ13 #game studies
- Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words (CC, SF, OFG, KQ), pp. 174–187.
- AFL-2014-DuS #infinity #similarity
- Similarity density of the Thue-Morse word with overlap-free infinite binary words (CFD, JS), pp. 231–245.
- AFL-2014-HegedusN
- Representations of Circular Words (LH, BN), pp. 261–270.
- AFL-2014-Loding #automaton #infinity #problem
- Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.
- CIAA-2014-BieglerM #automaton #finite #on the
- On Comparing Deterministic Finite Automata and the Shuffle of Words (FB, IM), pp. 98–109.
- DLT-2014-DickyJ #finite #infinity
- Embedding Finite and Infinite Words into Overlapping Tiles — (AD, DJ), pp. 339–347.
- DLT-2014-KarhumakiP #on the
- On k-Abelian Palindromic Rich and Poor Words (JK, SP), pp. 191–202.
- DLT-2014-KociumakaRRW #standard
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (TK, JR, WR, TW), pp. 215–226.
- ICALP-v2-2014-PlaceZ #first-order #quantifier
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words (TP, MZ), pp. 342–353.
- LATA-2014-CarapelleFGQ #satisfiability
- Satisfiability for MTL and TPTL over Non-monotonic Data Words (CC, SF, OFG, KQ), pp. 248–259.
- LATA-2014-DrosteD #automaton #infinity #logic
- Weighted Automata and Logics for Infinite Nested Words (MD, SD), pp. 323–334.
- LATA-2014-MasseGHL #equation #morphism
- Solving Equations on Words with Morphisms and Antimorphisms (ABM, SG, SH, ML), pp. 186–197.
- LATA-2014-Vorel #automaton #complexity #problem
- Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.
- CHI-PLAY-2014-HarquailK #game studies #physics
- WORD BLASTOFF: a physics word game for iOS (NH, MK), pp. 347–350.
- CSCW-2014-ChenHMN #comprehension #social #social media
- Understanding individuals’ personal values from social media word use (JC, GH, JM, JN), pp. 405–414.
- HCI-AIMT-2014-Alexandris
- Accessing Cause-Result Relation and Diplomatic Information in Ancient “Journalistic” Texts with Universal Words (CA), pp. 351–361.
- HCI-TMT-2014-BuchdidB #case study #human-computer
- Is There HCI in IDTV? — An Exploratory Study on Their Words (SBB, MCCB), pp. 47–57.
- HCI-TMT-2014-HankiewiczB #performance #quality #source code #using
- Efficiency in Performing Basic Tasks Using Word Processing Programs by the Elderly as a Measure of the Ergonomic Quality of Software (KH, MB), pp. 481–488.
- HCI-TMT-2014-MatsumotoKKA #adaptation #automation #delivery #learning #student
- Evaluating an Automatic Adaptive Delivery Method of English Words Learning Contents for University Students in Science and Technology (SM, TK, TK, MA), pp. 510–520.
- HIMI-AS-2014-HirashimaYH #learning #problem
- Triplet Structure Model of Arithmetical Word Problems for Learning by Problem-Posing (TH, SY, YH), pp. 42–50.
- ICEIS-v3-2014-PosadaB #case study
- A Study on the Last 11 Years of ICEIS Conference — As Revealed by Its Words (JEGP, MCCB), pp. 100–111.
- CIKM-2014-LiangZHGB #identification #named #novel #sentiment
- CONR: A Novel Method for Sentiment Word Identification (JL, XZ, YH, LG, SB), pp. 1943–1946.
- CIKM-2014-XuBBGWLL #framework #named
- RC-NET: A General Framework for Incorporating Knowledge into Word Representations (CX, YB, JB, BG, GW, XL, TYL), pp. 1219–1228.
- CIKM-2014-ZhaoWLZ #framework #mining #refinement
- A Bootstrapping Based Refinement Framework for Mining Opinion Words and Targets (QZ, HW, PL, CZ), pp. 1995–1998.
- ECIR-2014-VechtomovaST #approach #information retrieval
- An Information Retrieval-Based Approach to Determining Contextual Opinion Polarity of Words (OV, KS, JT), pp. 553–559.
- ICML-c1-2014-InouyeRD #dependence #topic
- Admixture of Poisson MRFs: A Topic Model with Word Dependencies (DI, PDR, ISD), pp. 683–691.
- ICML-c1-2014-YogatamaS #multi
- Making the Most of Bag of Words: Sentence Regularization with Alternating Direction Method of Multipliers (DY, NAS), pp. 656–664.
- ICML-c2-2014-BothaB #composition #modelling
- Compositional Morphology for Word Representations and Language Modelling (JAB, PB), pp. 1899–1907.
- ICPR-2014-HazelhoffCW #classification #trade-off
- Optimal Performance-Efficiency Trade-off for Bag of Words Classification of Road Signs (LBH, IMC, PHNdW), pp. 2996–3001.
- ICPR-2014-RanjanHJ #image #retrieval
- Enhancing Word Image Retrieval in Presence of Font Variations (VR, GH, CVJ), pp. 2709–2714.
- ICPR-2014-TarafdarPRRC #documentation #visual notation
- Word Spotting in Bangla and English Graphical Documents (AT, UP, JYR, NR, BBC), pp. 3044–3049.
- ICPR-2014-WangEGLLF #approach #distance #documentation #edit distance #graph
- A Coarse-to-Fine Word Spotting Approach for Historical Handwritten Documents Based on Graph Embedding and Graph Edit Distance (PW, VE, CG, CL, JL, AF), pp. 3074–3079.
- ICPR-2014-ZhangT #recognition #using
- Unconstrained Handwritten Word Recognition Based on Trigrams Using BLSTM (XZ, CLT), pp. 2914–2919.
- KDIR-2014-ChakrabortyGR #approach #performance #retrieval
- A Word Association Based Approach for Improving Retrieval Performance from Noisy OCRed Text (AC, KG, UR), pp. 450–456.
- KDIR-2014-MorenoGV #data mining #mining #recognition #using
- Violence Recognition in Spanish Words using Data Mining (AFM, SBGB, JGVR), pp. 210–216.
- KDIR-2014-SuciuICDP #learning
- Learning Good Opinions from Just Two Words Is Not Bad (DAS, VVI, ACC, MD, RP), pp. 233–241.
- SIGIR-2014-GrossDT #documentation #summary
- Document summarization based on word associations (OG, AD, HT), pp. 1023–1026.
- SIGIR-2014-LiuL #learning #probability #segmentation
- Probabilistic ensemble learning for vietnamese word segmentation (WL, LL), pp. 931–934.
- SIGIR-2014-ZhangKQH #detection #semantics
- Continuous word embeddings for detecting local text reuses at the semantic level (QZ, JK, JQ, XH), pp. 797–806.
- LICS-CSL-2014-BarceloM #combinator #graph #logic
- Graph logics with rational relations: the role of word combinatorics (PB, PM), p. 10.
- DRR-2013-KumarPR #image #named #recognition #segmentation
- NESP: Nonlinear enhancement and selection of plane for optimal segmentation and recognition of scene word images (DK, MNAP, AGR).
- DRR-2013-OpreanLM #adaptation #database #preprocessor
- Handwritten word preprocessing for database adaptation (CO, LLS, CM).
- DRR-2013-RicquebourgCG #evaluation #recognition #robust #verification
- Evaluation of lexicon size variations on a verification and rejection system based on SVM, for accurate and robust recognition of handwritten words (YR, BC, LG).
- ICDAR-2013-AldavertRTL #string #visual notation
- Integrating Visual and Textual Cues for Query-by-String Word Spotting (DA, MR, RT, JL), pp. 511–515.
- ICDAR-2013-BlucheNK #feature model #network #recognition
- Feature Extraction with Convolutional Neural Networks for Handwritten Word Recognition (TB, HN, CK), pp. 285–289.
- ICDAR-2013-DovgalecsBTNH #documentation #exclamation
- Spot It! Finding Words and Patterns in Historical Documents (VD, AB, PT, SN, LH), pp. 1039–1043.
- ICDAR-2013-GoelMAJ
- Whole is Greater than Sum of Parts: Recognizing Scene Text Words (VG, AM, KA, CVJ), pp. 398–402.
- ICDAR-2013-Howe #modelling
- Part-Structured Inkball Models for One-Shot Handwritten Word Spotting (NRH), pp. 582–586.
- ICDAR-2013-KessentiniCP #detection #documentation #regular expression
- Word Spotting and Regular Expression Detection in Handwritten Documents (YK, CC, TP), pp. 516–520.
- ICDAR-2013-KhayyatLS #classification #verification
- Verification of Hierarchical Classifier Results for Handwritten Arabic Word Spotting (MK, LL, CYS), pp. 572–576.
- ICDAR-2013-KleberFDS #database #identification #named #retrieval
- CVL-DataBase: An Off-Line Database for Writer Retrieval, Writer Identification and Word Spotting (FK, SF, MD, RS), pp. 560–564.
- ICDAR-2013-KrayemSEO #recognition #using
- Holistic Arabic Whole Word Recognition Using HMM and Block-Based DCT (AK, NS, LJE, TO), pp. 1120–1124.
- ICDAR-2013-KrishnanJ #image #retrieval #semantics
- Bringing Semantics in Word Image Retrieval (PK, CVJ), pp. 733–737.
- ICDAR-2013-KunzeKYK #documentation #eye tracking #image #mobile #retrieval #using
- The Wordometer — Estimating the Number of Words Read Using Document Image Retrieval and Mobile Eye Tracking (KK, HK, KY, KK), pp. 25–29.
- ICDAR-2013-LiuLSX #documentation #image #modelling #retrieval
- Modeling Local Word Spatial Configurations for Near Duplicate Document Image Retrieval (LL, YL, CYS, JX), pp. 235–239.
- ICDAR-2013-MondalRRP #kernel #locality #performance #retrieval
- A Fast Word Retrieval Technique Based on Kernelized Locality Sensitive Hashing (TM, NR, JYR, UP), pp. 1195–1199.
- ICDAR-2013-OpreanLPM #recognition #using #web
- Using the Web to Create Dynamic Dictionaries in Handwritten Out-of-Vocabulary Word Recognition (CO, LLS, AP, CM), pp. 989–993.
- ICDAR-2013-PantkeMF #evaluation #on the
- On Evaluation of Segmentation-Free Word Spotting Approaches without Hard Decisions (WP, VM, TF), pp. 1300–1304.
- ICDAR-2013-PapandreouG #estimation
- A Coarse to Fine Skew Estimation Technique for Handwritten Words (AP, BG), pp. 225–229.
- ICDAR-2013-RothackerRF #documentation
- Bag-of-Features HMMs for Segmentation-Free Word Spotting in Handwritten Documents (LR, MR, GAF), pp. 1305–1309.
- ICDAR-2013-Saabni #distance #embedded #image #performance #retrieval #using
- Efficient Word Image Retrieval Using Earth Movers Distance Embedded to Wavelets Coefficients Domain (RS), pp. 314–318.
- ICDAR-2013-SaidaniEB #identification
- Identification of Machine-Printed and Handwritten Words in Arabic and Latin Scripts (AS, AKE, AB), pp. 798–802.
- ICDAR-2013-SharmaSPBT #multi #segmentation #video
- A New Method for Character Segmentation from Multi-oriented Video Words (NS, PS, UP, MB, CLT), pp. 413–417.
- ICDAR-2013-ShekharJ #documentation #retrieval
- Document Specific Sparse Coding for Word Retrieval (RS, CVJ), pp. 643–647.
- ICDAR-2013-ShivramZSNG #online #random #recognition #segmentation
- Segmentation Based Online Word Recognition: A Conditional Random Field Driven Beam Search Strategy (AS, BZ, SS, MN, VG), pp. 852–856.
- ICDAR-2013-SuDPL #comprehension #documentation #novel
- Cross-Language Sensitive Words Distribution Map: A Novel Recognition-Based Document Understanding Method for Uighur and Tibetan (BS, XD, LP, CL), pp. 255–259.
- ICDAR-2013-TarafdarPRRR #approach #documentation #visual notation
- A Two-Stage Approach for Word Spotting in Graphical Documents (AT, UP, PPR, NR, JYR), pp. 319–323.
- ICDAR-2013-ToselliV #approach #documentation #performance
- Fast HMM-Filler Approach for Key Word Spotting in Handwritten Documents (AHT, EV), pp. 501–505.
- ICDAR-2013-WangEGLM #representation
- A Comprehensive Representation Model for Handwriting Dedicated to Word Spotting (PW, VE, CG, CL, AM), pp. 450–454.
- ICDAR-2013-ZhuSSGN #2d #online #recognition #using
- Online Handwritten Cursive Word Recognition Using Segmentation-Free MRF in Combination with P2DBMN-MQDF (BZ, AS, SS, VG, MN), pp. 349–353.
- TPDL-2013-Freire
- Word Occurrence Based Extraction of Work Contributors from Statements of Responsibility (NF), pp. 168–179.
- MSR-2013-HowardGPV #automation #mining #semantics
- Automatically mining software-based, semantically-similar words from comment-code mappings (MJH, SG, LLP, KVS), pp. 377–386.
- CIAA-J-2012-GocHS13 #automation #combinator
- Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 781–798.
- DLT-J-2012-EsikO13 #context-free grammar #on the
- On Context-Free Languages of Scattered Words (ZÉ, SO), pp. 1029–1048.
- DLT-J-2012-MasseDGH13 #multi #pseudo
- Multipseudoperiodic Words (ABM, SD, SG, SH), pp. 1153–1166.
- CIAA-2013-BalkanskiBKW
- Partial Word DFAs (EB, FBS, MK, BJW), pp. 36–47.
- CIAA-2013-ChistikovM #theorem
- A Uniformization Theorem for Nested Word to Word Transductions (DVC, RM), pp. 97–108.
- CIAA-2013-DebarbieuxGNSZ #automaton #query #xml #xpath
- Early Nested Word Automata for XPath Query Answering on XML Streams (DD, OG, JN, TS, MZ), pp. 292–305.
- DLT-2013-Blanchet-SadriF #complexity #on the
- On the Asymptotic Abelian Complexity of Morphic Words (FBS, NF), pp. 94–105.
- DLT-2013-BonomoMRRS
- Suffixes, Conjugates and Lyndon Words (SB, SM, AR, GR, MS), pp. 131–142.
- DLT-2013-CurrieRS #sequence
- Extremal Words in the Shift Orbit Closure of a Morphic Sequence (JDC, NR, KS), pp. 143–154.
- DLT-2013-FiciLLLMP
- Abelian Repetitions in Sturmian Words (GF, AL, TL, AL, FM, ÉPG), pp. 227–238.
- DLT-2013-Jez #equation #named
- Recompression: Word Equations and Beyond (AJ), pp. 12–26.
- DLT-2013-LibkinTV #database #graph #query #regular expression
- Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.
- DLT-2013-LucaPZ #problem
- A Coloring Problem for Sturmian and Episturmian Words (AdL, EVP, LQZ), pp. 191–202.
- DLT-2013-RampersadRS #on the
- On the Number of Abelian Bordered Words (NR, MR, PS), pp. 420–432.
- ICALP-v2-2013-CharlierKPZ #self
- Self-shuffling Words (EC, TK, SP, LQZ), pp. 113–124.
- ICALP-v2-2013-Jez #equation #linear
- One-Variable Word Equations in Linear Time (AJ), pp. 324–335.
- LATA-2013-Blanchet-SadriL #problem
- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
- LATA-2013-GocSS #automation #sequence
- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences (DG, KS, JS), pp. 311–322.
- LATA-2013-Schaeffer
- Ostrowski Numeration and the Local Period of Sturmian Words (LS), pp. 493–503.
- ICFP-2013-TraytelN #regular expression
- Verified decision procedures for MSO on words based on derivatives of regular expressions (DT, TN), pp. 3–12.
- HCI-AS-2013-MatsumotoAK #development #email #learning #using
- Development of Push-Based English Words Learning System by Using E-Mail Service (SM, MA, TK), pp. 444–453.
- HCI-IMT-2013-TruongNTD #collaboration #predict
- Collaborative Smart Virtual Keyboard with Word Predicting Function (CTT, DHNH, MTT, ADD), pp. 513–522.
- HIMI-D-2013-YanagimotoSY #classification #estimation #network #sentiment #using
- Word Classification for Sentiment Polarity Estimation Using Neural Network (HY, MS, AY), pp. 669–677.
- ICEIS-v3-2013-BuchdidB #human-computer #what
- HCI in Context — What the Words Reveal about It (SBB, MCCB), pp. 134–142.
- CIKM-2013-WangYLZH #network #summary #topic
- Content coverage maximization on word networks for hierarchical topic summarization (CW, XY, YL, CZ, JH), pp. 249–258.
- ECIR-2013-PanchenkoRMNPRF #named #semantics #visualisation
- Serelex: Search and Visualization of Semantically Related Words (AP, PR, OM, HN, AP, AR, CF), pp. 837–840.
- ECIR-2013-ProkofyevDBRC #ambiguity #ontology
- Ontology-Based Word Sense Disambiguation for Scientific Literature (RP, GD, AB, OR, PCM), pp. 594–605.
- ICML-c3-2013-WeinshallLH #topic
- LDA Topic Model with Soft Assignment of Descriptors to Words (DW, GL, DH), pp. 711–719.
- MLDM-2013-SouzaP #random #recognition
- Sign Language Recognition with Support Vector Machines and Hidden Conditional Random Fields: Going from Fingerspelling to Natural Articulated Words (CRdS, EBP), pp. 84–98.
- SIGIR-2013-JameelL #order #segmentation #topic
- An unsupervised topic segmentation model incorporating word order (SJ, WL), pp. 203–212.
- SAC-2013-ChanHN #layout #semantics #using #wiki
- Computing semantic relatedness using word frequency and layout information of Wikipedia (PC, YH, SN), pp. 282–287.
- SAC-2013-LaroucheMGH #equation #satisfiability
- Solving equations on words through boolean satisfiability (ML, ABM, SG, SH), pp. 104–106.
- FoSSaCS-2013-BolligGM #specification
- Weighted Specifications over Nested Words (BB, PG, BM), pp. 385–400.
- LICS-2013-Colcombet #logic #monad #set #using
- Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.
- LICS-2013-Riba #infinity
- Forcing MSO on Infinite Words in Weak MSO (CR), pp. 448–457.
- DRR-2012-Bianne-BernardMLMK #modelling #recognition
- Variable length and context-dependent HMM letter form models for Arabic handwritten word recognition (ALBB, FM, LLS, CM, CK).
- DRR-2012-SaldarriagaMV #ranking
- Retrieving handwriting by combining word spotting and manifold ranking (SPS, EM, CVG).
- JCDL-2012-CraneABCHBD #library #research #student
- Student researchers, citizen scholars and the trillion word library (GRC, BA, AB, LC, MH, DB, HD), pp. 213–222.
- SIGMOD-2012-RosnerHGPB #correlation #performance
- Fast sampling word correlations of high dimensional text data (FR, AH, MG, MP, AB), p. 866.
- TPDL-2012-TahmasebiGR
- Which Words Do You Remember? Temporal Properties of Language Use in Digital Archives (NT, GG, TR), pp. 32–37.
- MSR-2012-YangT #semantics
- Inferring semantically related words from software context (JY, LT), pp. 161–170.
- AFL-J-2011-Blanchet-Sadri12 #algorithm #combinator
- Algorithmic Combinatorics on Partial Words (FBS), pp. 1189–1206.
- DLT-J-2011-DiekertM12 #infinity
- Group Extensions over Infinite Words (VD, AGM), pp. 1001–1020.
- DLT-J-2011-DomaratzkiR12
- Abelian Primitive Words (MD, NR), pp. 1021–1034.
- DLT-J-2011-PelantovaS12 #image
- Almost Rich Words as Morphic Images of Rich Words (EP, SS), pp. 1067–1084.
- CIAA-2012-DrosteP #automaton #logic
- Weighted Nested Word Automata and Logics over Strong Bimonoids (MD, BP), pp. 138–148.
- CIAA-2012-GocHS #automation #combinator
- Automatic Theorem-Proving in Combinatorics on Words (DG, DH, JS), pp. 180–191.
- DLT-2012-0002HOT #context-free grammar #problem
- Semigroups with a Context-Free Word Problem (MH, DFH, MDO, RMT), pp. 97–108.
- DLT-2012-Blanchet-SadriJM
- Squares in Binary Partial Words (FBS, YJ, JMM), pp. 404–415.
- DLT-2012-EsikO #context-free grammar #on the
- On Context-Free Languages of Scattered Words (ZÉ, SO), pp. 142–153.
- DLT-2012-GandhiKL #complexity #finite #on the
- On State Complexity of Finite Word and Tree Languages (AG, BK, JL), pp. 392–403.
- DLT-2012-MasseGH #pseudo
- Pseudoperiodic Words (ABM, SG, SH), pp. 308–319.
- ICALP-v2-2012-KufleitnerL #logic
- Lattices of Logical Fragments over Words — (MK, AL), pp. 275–286.
- ICALP-v2-2012-KuperbergB #infinity #logic #on the #power of
- On the Expressive Power of Cost Logics over Infinite Words (DK, MVB), pp. 287–298.
- ICALP-v2-2012-Torunczyk #problem
- Languages of Profinite Words and the Limitedness Problem (ST), pp. 377–389.
- LATA-2012-KaraST #automaton #logic
- Feasible Automata for Two-Variable Logic with Successor on Data Words (AK, TS, TT), pp. 351–362.
- FDG-2012-SaliLWMK #interactive #natural language
- Getting a word in: adding artificial pauses to natural language interaction (SS, RL, NWF, MM, SK), pp. 57–64.
- CSCW-2012-RzeszotarskiK #learning #predict #wiki
- Learning from history: predicting reverted work at the word level in wikipedia (JMR, AK), pp. 437–440.
- CIKM-2012-JuLSZHL #classification #documentation #sentiment
- Dual word and document seed selection for semi-supervised sentiment classification (SJ, SL, YS, GZ, YH, XL), pp. 2295–2298.
- CIKM-2012-Kawamae #topic
- Theme chronicle model: chronicle consists of timestamp and topical words over each theme (NK), pp. 2065–2069.
- CIKM-2012-KimYK #equation #query #retrieval #using
- Mathematical equation retrieval using plain words as a query (SK, SY, YK), pp. 2407–2410.
- CIKM-2012-LiHTH #correlation #information management #semantics #topic
- Incorporating word correlation into tag-topic model for semantic knowledge acquisition (FL, TH, XT, XH), pp. 1622–1626.
- CIKM-2012-SiposSSJ #corpus #summary #using
- Temporal corpus summarization using submodular word coverage (RS, AS, PS, TJ), pp. 754–763.
- CIKM-2012-WangC #learning #predict
- Learning to predict the cost-per-click for your ad words (CJW, HHC), pp. 2291–2294.
- CIKM-2012-XuKZ #generative #timeline
- A picture paints a thousand words: a method of generating image-text timelines (SX, LK, YZ), pp. 2511–2514.
- ECIR-2012-ChhedaFM
- Handling OOV Words in Indian-language — English CLIR (PC, MF, PM), pp. 476–479.
- ICML-2012-DahlAL #strict
- Training Restricted Boltzmann Machines on Word Observations (GED, RPA, HL), p. 152.
- ICML-2012-DhillonRFU #modelling #using
- Using CCA to improve CCA: A new spectral method for estimating vector models of words (PSD, JR, DPF, LHU), p. 13.
- ICPR-2012-AjmeraD #analysis #detection
- Combining text and prosodic analysis for prominent word detection (JA, ODD), pp. 1534–1537.
- ICPR-2012-JiangDPL
- Analyzing the information entropy of states to optimize the number of states in an HMM-based off-line handwritten Arabic word recognizer (ZJ, XD, LP, CL), pp. 697–700.
- ICPR-2012-SantosPTGPF #classification #image #multi #using #visual notation
- Improving texture description in remote sensing image multi-scale classification tasks by using visual words (JAdS, OABP, RdST, PHG, SPF, AXF), pp. 3090–3093.
- ICPR-2012-WshahKG #documentation #multi
- Multilingual word spotting in offline handwritten documents (SW, GK, VG), pp. 310–313.
- KDD-2012-HalawiDGK #constraints #learning #scalability
- Large-scale learning of word relatedness with constraints (GH, GD, EG, YK), pp. 1406–1414.
- KEOD-2012-SuzukiF #overview #segmentation #similarity #using
- Segmentation of Review Texts by using Thesaurus and Corpus-based Word Similarity (YS, FF), pp. 381–384.
- SIGIR-2012-NishidaHF #classification #detection #probability #twitter
- Improving tweet stream classification by detecting changes in word probability (KN, TH, KF), pp. 971–980.
- SIGIR-2012-Sun #classification #using
- Short text classification using very few words (AS), pp. 1145–1146.
- FoSSaCS-2012-BolligCGK #model checking
- Model Checking Languages of Data Words (BB, AC, PG, KNK), pp. 391–405.
- IJCAR-2012-EmmerKKSV #bound #model checking
- EPR-Based Bounded Model Checking at Word Level (ME, ZK, KK, CS, AV), pp. 210–224.
- LICS-2012-ChatterjeeT #automaton #decidability #infinity #probability #problem
- Decidable Problems for Probabilistic Automata on Infinite Words (KC, MT), pp. 185–194.
- DRR-2011-SaabniE #distance #documentation #using
- Word spotting for handwritten documents using Chamfer Distance and Dynamic Time Warping (RS, JES), pp. 1–10.
- ICDAR-2011-AbidiSK #approach #library #retrieval #towards
- Towards Searchable Digital Urdu Libraries — A Word Spotting Based Retrieval Approach (AA, IS, KK), pp. 1344–1348.
- ICDAR-2011-BoumaizaT #approach #novel #recognition #representation
- A Novel Approach for Graphics Recognition Based on Galois Lattice and Bag of Words Representation (AB, ST), pp. 829–833.
- ICDAR-2011-BuiVPO #identification #recognition #using
- Writer Identification Using TF-IDF for Cursive Handwritten Word Recognition (QAB, MV, SP, JMO), pp. 844–848.
- ICDAR-2011-BurgerKP #recognition
- Dempster-Shafer Based Rejection Strategy for Handwritten Word Recognition (TB, YK, TP), pp. 528–532.
- ICDAR-2011-ColuttoG #difference #performance #recognition #using
- Efficient Word Recognition Using a Pixel-Based Dissimilarity Measure (SC, BG), pp. 1110–1114.
- ICDAR-2011-FrinkenFBF #recognition
- Co-training for Handwritten Word Recognition (VF, AF, HB, AF), pp. 314–318.
- ICDAR-2011-GaoSWG #documentation #recognition
- Classical Mongolian Words Recognition in Historical Document (GG, XS, HW, YG), pp. 692–697.
- ICDAR-2011-GatosKP #adaptation #recognition
- Adaptive Zoning Features for Character and Word Recognition (BG, ALK, AP), pp. 1160–1164.
- ICDAR-2011-GuichardCC #documentation
- Exploiting Collection Level for Improving Assisted Handwritten Word Transcription of Historical Documents (LG, JC, BC), pp. 875–879.
- ICDAR-2011-HamamuraINOS #clustering #concurrent #optimisation #recognition #using
- Concurrent Optimization of Context Clustering and GMM for Offline Handwritten Word Recognition Using HMM (TH, BI, TN, NO, SS), pp. 523–527.
- ICDAR-2011-JainFJM #documentation #network #retrieval
- BLSTM Neural Network Based Word Retrieval for Hindi Documents (RJ, VF, CVJ, RM), pp. 83–87.
- ICDAR-2011-JayadevanKPP #database #development #recognition
- Database Development and Recognition of Handwritten Devanagari Legal Amount Words (RJ, SRK, PMP, UP), pp. 304–308.
- ICDAR-2011-KennardBS #recognition
- Word Warping for Offline Handwriting Recognition (DJK, WAB, TWS), pp. 1349–1353.
- ICDAR-2011-KesidisG #estimation #performance
- Efficient Cut-Off Threshold Estimation for Word Spotting Applications (ALK, BG), pp. 279–283.
- ICDAR-2011-KessentiniPG #algorithm #multi #recognition
- An Optimized Multi-stream Decoding Algorithm for Handwritten Word Recognition (YK, TP, AG), pp. 192–196.
- ICDAR-2011-RajendranSSLT #recognition #video
- A New Fourier-Moments Based Video Word and Character Extraction Method for Recognition (DR, PS, BS, SL, CLT), pp. 1165–1169.
- ICDAR-2011-RoyRR #documentation #retrieval #using
- Word Retrieval in Historical Document Using Character-Primitives (PPR, JYR, NR), pp. 678–682.
- ICDAR-2011-RusinolATL #documentation
- Browsing Heterogeneous Document Collections by a Segmentation-Free Word Spotting Method (MR, DA, RT, JL), pp. 63–67.
- ICDAR-2011-SaldarriagaC #network #online #using
- Indexing On-line Handwritten Texts Using Word Confusion Networks (SPS, MC), pp. 197–201.
- ICDAR-2011-SimistiraPSK #segmentation
- Enhancing Handwritten Word Segmentation by Employing Local Spatial Features (FS, VP, TS, VK), pp. 1314–1318.
- ICDAR-2011-SundaramR #novel #online #segmentation
- Lexicon-Free, Novel Segmentation of Online Handwritten Indic Words (SS, AGR), pp. 1175–1179.
- ICDAR-2011-WeiGB
- A Method for Removing Inflectional Suffixes in Word Spotting of Mongolian Kanjur (HW, GG, YB), pp. 88–92.
- ICDAR-2011-YiT #detection #image
- Text Detection in Natural Scene Images by Stroke Gabor Words (CY, YT), pp. 177–181.
- JCDL-2011-BammanC
- Measuring historical word sense variation (DB, GRC), pp. 1–10.
- JCDL-2011-SpagnolaL #matter #order #topic
- Word order matters: measuring topic coherence with lexical argument structure (SS, CL), pp. 21–24.
- DLT-J-2009-BealBP11 #automaton #bound #clustering #polynomial
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, MVB, DP), pp. 277–288.
- DLT-J-2009-KariMS11 #pseudo
- Properties of Pseudo-Primitive Words and their Applications (LK, BM, SS), pp. 447–471.
- DLT-J-2009-LaineP11 #equation
- Word Equations with One Unknown (ML, WP), pp. 345–375.
- AFL-2011-Blanchet-Sadri #problem
- Open Problems on Avoidable Patterns in Partial Words (FBS), pp. 12–24.
- AFL-2011-Blanchet-SadriNT #on the
- On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.
- AFL-2011-Choffrut #finite #infinity #on the
- On relations of finite words over infinite alphabets (CC), pp. 25–27.
- AFL-2011-IvanM #context-free grammar #generative
- Müller context-free grammars generating well-ordered words (SI, ÁM), pp. 225–240.
- AFL-2011-PramodK #polynomial #towards
- Towards Shortest Synchronizing Words in Polynomial Time (VTKP, KVK), pp. 358–367.
- CIAA-2011-ChairungseeC
- Building Phylogeny with Minimal Absent Words (SC, MC), pp. 100–109.
- CIAA-2011-Martyugin #automaton #complexity #problem
- Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (PM), pp. 238–249.
- CIAA-2011-SkvortsovT #automaton #case study #random
- Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.
- DLT-2011-Blanchet-SadriS
- Avoiding Abelian Powers in Partial Words (FBS, SS), pp. 70–81.
- DLT-2011-CherubiniFP
- Short 3-Collapsing Words over a 2-Letter Alphabet (AC, AF, BP), pp. 469–471.
- DLT-2011-DiekertM #infinity #problem
- Solving Word Problems in Group Extensions over Infinite Words (VD, AGM), pp. 192–203.
- DLT-2011-DomaratzkiR
- Abelian Primitive Words (MD, NR), pp. 204–215.
- DLT-2011-FiciL #on the
- On Prefix Normal Words (GF, ZL), pp. 228–238.
- DLT-2011-PelantovaS #infinity
- Infinite Words Rich and Almost Rich in Generalized Palindromes (EP, SS), pp. 406–416.
- DLT-2011-RampersadV #on the
- On Highly Repetitive and Power Free Words (NR, EV), pp. 441–451.
- ICALP-v2-2011-CartonCP #linear #order #regular expression
- Regular Languages of Words over Countable Linear Orderings (OC, TC, GP), pp. 125–136.
- ICALP-v2-2011-LohreyM #morphism
- Isomorphism of Regular Trees and Words (ML, CM), pp. 210–221.
- LATA-2011-Blanchet-SadriBZ
- Unary Pattern Avoidance in Partial Words Dense with Holes (FBS, KB, AZ), pp. 155–166.
- LATA-2011-OkhotinS #ambiguity #automaton #complexity
- Descriptional Complexity of Unambiguous Nested Word Automata (AO, KS), pp. 414–426.
- LATA-2011-ReidenbachS #memory management #scheduling
- Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access (DR, MLS), pp. 465–476.
- CHI-2011-YataniNTT #overview #user interface #using
- Review spotlight: a user interface for summarizing user-generated reviews using adjective-noun word pairs (KY, MN, AT, KNT), pp. 1541–1550.
- DUXU-v1-2011-Hasan #multi #online #visual notation
- Multi-language Online Word Processor for Learners and the Visually Impaired (SIH), pp. 256–260.
- DUXU-v1-2011-PrabhalaLG #people #question #what
- Ethnography, Ethnography or Ethnography? What Happens When the Same Word Means Different Things to Different People? (SP, DL, SG), pp. 102–110.
- HCD-2011-Kurosu #experience #user interface
- Descriptive Words for Expressing the User Experience (MK), pp. 81–90.
- HCI-UA-2011-IshidaNKOT
- Therapeutic Category Improvement Method Based on the Words Appearing in Effect-Efficacy Description (HI, KN, MK, MO, FT), pp. 174–181.
- HIMI-v2-2011-ItouOM #analysis #chat
- Analysis on Relationship between Smiley and Emotional Word Included in Chat Text (JI, TO, JM), pp. 141–146.
- ICEIS-v2-2011-FirozeAQR #recognition #speech
- Bangla Isolated Word Speech Recognition (AF, MSA, RQ, RMR), pp. 73–82.
- CIKM-2011-CarmelUGMR #generative
- Folksonomy-based term extraction for word cloud generation (DC, EU, IG, YM, HR), pp. 2437–2440.
- CIKM-2011-LinTC #classification #independence #sentiment #using
- Language-independent sentiment classification using three common words (ZL, ST, XC), pp. 1041–1046.
- CIKM-2011-NavigliFSLA #ambiguity #categorisation #learning #modelling #semantics
- Two birds with one stone: learning semantic models for text categorization and word sense disambiguation (RN, SF, AS, OLdL, EA), pp. 2317–2320.
- ECIR-2011-LiSD #ambiguity #wiki
- A Generalized Method for Word Sense Disambiguation Based on Wikipedia (CL, AS, AD), pp. 653–664.
- KDIR-2011-RoleN #case study #metric #similarity
- Handling the Impact of Low Frequency Events on Co-occurrence based Measures of Word Similarity — A Case Study of Pointwise Mutual Information (FR, MN), pp. 226–231.
- KEOD-2011-FukumotoS #classification #clustering #graph #semantics
- Semantic Classification of Unknown Words based on Graph-based Semi-supervised Clustering (FF, YS), pp. 37–46.
- SIGIR-2011-OchiOO #predict #rating #using
- Rating prediction using feature words extracted from customer reviews (MO, MO, RO), pp. 1205–1206.
- SAC-2011-DinhT #concept #order
- Biomedical concept extraction based on combining the content-based and word order similarities (DD, LT), pp. 1159–1163.
- FoSSaCS-2011-CaucalH #term rewriting
- Regularity and Context-Freeness over Word Rewriting Systems (DC, DTH), pp. 214–228.
- FoSSaCS-2011-DaxK #automaton
- Alternation Elimination for Automata over Nested Words (CD, FK), pp. 168–183.
- CSL-2011-Straubing #algebra #finite
- Algebraic Characterization of the Alternation Hierarchy in FO2[<] on Finite Words (HS), pp. 525–537.
- LICS-2011-Figueira #decidability #logic
- A Decidable Two-Way Logic on Data Words (DF), pp. 365–374.
- LICS-2011-KufleitnerL #infinity
- Languages of Dot-Depth One over Infinite Words (MK, AL), pp. 23–32.
- DRR-2010-BianneKL #clustering #modelling #recognition #using
- Context-dependent HMM modeling using tree-based clustering for the recognition of handwritten words (ALB, CK, LLS), pp. 1–10.
- DRR-2010-CheikhKB #approach #recognition
- A neural-linguistic approach for the recognition of a wide Arabic word lexicon (IBC, AK, AB), pp. 1–10.
- DRR-2010-ChenMT #automation #performance #using #validation
- Efficient automatic OCR word validation using word partial format derivation and language model (SC, DM, GRT), pp. 1–10.
- DRR-2010-HuangDC #modelling #recognition
- A word language model based contextual language processing on Chinese character recognition (CH, XD, YC), pp. 1–10.
- JCDL-2010-TahmasebiNTR #documentation #using
- Using word sense discrimination on historic document collections (NT, KN, TT, TR), pp. 89–98.
- VLDB-2010-MozafariZZ #execution #query #regular expression #relational #sequence #xml
- From Regular Expressions to Nested Words: Unifying Languages and Query Execution for Relational and XML Sequences (BM, KZ, CZ), pp. 150–161.
- CSMR-2010-MadaniGPGA #identifier #recognition #source code #speech #using
- Recognizing Words from Source Code Identifiers Using Speech Recognition Techniques (NM, LG, MDP, YGG, GA), pp. 68–77.
- AFL-J-2008-Blanchet-SadriOR10 #theorem
- Fine and Wilf’s Theorem for Partial Words with Arbitrarily Many Weak Periods (FBS, TO, TDR), pp. 705–722.
- DLT-J-2008-HolubN10 #finite #on the
- On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 633–645.
- DLT-J-2008-MantaciMR10
- Balance Properties and Distribution of Squares in Circular Words (RM, SM, AR), pp. 647–664.
- CIAA-2010-Egri-NagyN #finite #on the
- On Straight Words and Minimal Permutators in Finite Transformation Semigroups (AEN, CLN), pp. 115–124.
- DLT-2010-DartoisKL #infinity
- Rankers over Infinite Words (LD, MK, AL), pp. 148–159.
- DLT-2010-HalavaHKR #on the
- On the Periodicity of Morphic Words (VH, TH, TK, MR), pp. 209–217.
- DLT-2010-HalldorssonKP #graph
- Graphs Capturing Alternations in Words (MMH, SK, AVP), pp. 436–437.
- DLT-2010-HauboldLM #graph #morphism #problem
- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups (NH, ML, CM), pp. 218–230.
- DLT-2010-Staiger #finite #infinity
- Joint Topologies for Finite and Infinite Words (LS), pp. 442–443.
- ICALP-v2-2010-GimbertO #automaton #decidability #finite #probability #problem
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (HG, YO), pp. 527–538.
- LATA-2010-Blanchet-SadriKMSS
- Abelian Square-Free Partial Words (FBS, JIK, RM, WS, SS), pp. 94–105.
- LATA-2010-Blanchet-SadriMSW
- Avoidable Binary Patterns in Partial Words (FBS, RM, SS, EW), pp. 106–117.
- LATA-2010-CarrascosaCGL #problem
- Choosing Word Occurrences for the Smallest Grammar Problem (RC, FC, MG, GGIL), pp. 154–165.
- LATA-2010-Leupold #context-free grammar
- Primitive Words Are Unavoidable for Context-Free Languages (PL), pp. 403–413.
- LATA-2010-ManeaT #problem
- Hard Counting Problems for Partial Words (FM, CT), pp. 426–438.
- RTA-2010-Bojanczyk #automaton
- Automata for Data Words and Data Trees (MB), pp. 1–4.
- FDG-2010-SaliWDMKRL #evaluation #game studies #interface
- Playing with words: from intuition to evaluation of game dialogue interfaces (SS, NWF, SD, MM, SK, AAR, RL), pp. 179–186.
- CIKM-2010-DragutYSM #sentiment #taxonomy
- Construction of a sentimental word dictionary (ECD, CTY, APS, WM), pp. 1761–1764.
- CIKM-2010-GaoHN #modelling #web
- Clickthrough-based translation models for web search: from word models to phrase models (JG, XH, JYN), pp. 1139–1148.
- CIKM-2010-HuangSN #graph #query #refinement #using
- Query model refinement using word graphs (YH, LS, JYN), pp. 1453–1456.
- ECIR-2010-PotthastTS #named
- Netspeak — Assisting Writers in Choosing Words (MP, MT, BS), p. 672.
- ICPR-2010-AbedM #framework #recognition
- A Framework for the Combination of Different Arabic Handwritten Word Recognition Systems (HEA, VM), pp. 1904–1907.
- ICPR-2010-BassiouK #clustering #distance #using
- Word Clustering Using PLSA Enhanced with Long Distance Bigrams (NB, CK), pp. 4226–4229.
- ICPR-2010-BharathM #empirical #on the #online #recognition
- On the Significance of Stroke Size and Position for Online Handwritten Devanagari Word Recognition: An Empirical Study (AB, SM), pp. 2033–2036.
- ICPR-2010-BhatBSS #sequence #transitive #video #visual notation
- Transitive Closure Based Visual Words for Point Matching in Video Sequence (KKSB, MOB, GS, FS), pp. 3300–3303.
- ICPR-2010-FischerKFB #documentation #modelling #using
- HMM-based Word Spotting in Handwritten Documents Using Subword Models (AF, AK, VF, HB), pp. 3416–3419.
- ICPR-2010-FraundorferWP #locality #mobile #using #visual notation
- Combining Monocular and Stereo Cues for Mobile Robot Localization Using Visual Words (FF, CW, MP), pp. 3927–3930.
- ICPR-2010-GuichardTC #novel #recognition #verification
- A Novel Verification System for Handwritten Words Recognition (LG, AHT, BC), pp. 2869–2872.
- ICPR-2010-Hotta #classification #using #visual notation
- Scene Classification Using Local Co-occurrence Feature in Subspace Obtained by KPCA of Local Blob Visual Words (KH), pp. 4230–4233.
- ICPR-2010-LiIK #recognition #robust #using
- Robust Face Recognition Using Block-Based Bag of Words (ZL, JiI, MK), pp. 1285–1288.
- ICPR-2010-MengXZZ #recognition
- A New Application of MEG and DTI on Word Recognition (LM, JX, DZ, HZ), pp. 2472–2475.
- ICPR-2010-PinedaKW #clustering #correlation #set #visual notation
- Object Discovery by Clustering Correlated Visual Word Sets (GFP, HK, TW), pp. 750–753.
- ICPR-2010-PrumVO #online #recognition #using
- On-Line Handwriting Word Recognition Using a Bi-character Model (SP, MV, JMO), pp. 2700–2703.
- ICPR-2010-SagheerHNS #recognition #using
- Holistic Urdu Handwritten Word Recognition Using Support Vector Machine (MWS, CLH, NN, CYS), pp. 1900–1903.
- ICPR-2010-SagheerNHS #analysis #component #novel
- A Novel Handwritten Urdu Word Spotting Based on Connected Components Analysis (MWS, NN, CLH, CYS), pp. 2013–2016.
- ICPR-2010-SaitohK #recognition
- Profile Lip Reading for Vowel and Word Recognition (TS, RK), pp. 1356–1359.
- ICPR-2010-WuLSZ #modelling
- Integrating ILSR to Bag-of-Visual Words Model Based on Sparse Codes of SIFT Features Representations (LW, SL, WS, XZ), pp. 4283–4286.
- KDIR-2010-EjbaliZA #approach #network #recognition
- Intelligent Approach to Train Wavelet Networks for Recognition System of Arabic Words (RE, MZ, CBA), pp. 518–522.
- KDIR-2010-KleizaKT #approach #documentation #identification #query #semantics #similarity #visualisation
- Semantic Identification and Visualization of Significant Words within Documents — Approach to Visualize Relevant Words within Documents to a Search Query by Word Similarity Computation (KK, PK, KDT), pp. 481–486.
- SAC-2010-RiosBKO #documentation #evaluation #set
- Evaluation of different feature sets in an OCR free method for word spotting in printed documents (IR, AdSBJ, ALK, LSO), pp. 52–56.
- CSL-2010-BenediktLP #automaton #logic
- Automata vs. Logics on Data Words (MB, CL, GP), pp. 110–124.
- DRR-2009-BhardwajCG #identification #image
- Script identification of handwritten word images (AB, HC, VG), pp. 1–10.
- DRR-2009-DoulgeriK #documentation #retrieval
- Retrieval of historical documents by word spotting (ND, EK), pp. 1–10.
- ECDL-2009-Gottron #documentation #visualisation #web
- Document Word Clouds: Visualising Web Documents as Tag Clouds to Aid Users in Relevance Decisions (TG), pp. 94–105.
- ICDAR-2009-AhmadVK #markov #recognition #using
- Lexicon-Based Word Recognition Using Support Vector Machine and Hidden Markov Model (ARA, CVG, MK), pp. 161–165.
- ICDAR-2009-AndreevK #image
- Word Image Matching Based on Hausdorff Distances (AA, NK), pp. 396–400.
- ICDAR-2009-AssabieB #recognition
- HMM-Based Handwritten Amharic Word Recognition with Feature Concatenation (YA, JB), pp. 961–965.
- ICDAR-2009-BaiLT #documentation #image #keyword
- Keyword Spotting in Document Images through Word Shape Coding (SB, LL, CLT), pp. 331–335.
- ICDAR-2009-DingJG #approach #online #recognition
- A New Method for Rotation Free Method for Online Unconstrained Handwritten Chinese Word Recognition: A Holistic Approach (KD, LJ, XG), pp. 1131–1135.
- ICDAR-2009-EynardE #documentation #recognition
- Italic or Roman: Word Style Recognition without A Priori Knowledge for Old Printed Documents (LE, HE), pp. 823–827.
- ICDAR-2009-FrinkenB #learning #network #recognition
- Evaluating Retraining Rules for Semi-Supervised Learning in Neural Network Based Cursive Word Recognition (VF, HB), pp. 31–35.
- ICDAR-2009-GatosP #documentation
- Segmentation-free Word Spotting in Historical Printed Documents (BG, IP), pp. 271–275.
- ICDAR-2009-GimenezJ #embedded #recognition
- Embedded Bernoulli Mixture HMMs for Handwritten Word Recognition (AG, AJ), pp. 896–900.
- ICDAR-2009-HamamuraAI #probability #recognition
- An A Posteriori Probability Calculation Method for Analytic Word Recognition Applicable to Address Recognition (TH, TA, BI), pp. 391–395.
- ICDAR-2009-ImpedovoFM #recognition #using
- HMM Based Handwritten Word Recognition System by Using Singularities (SI, AF, RM), pp. 783–787.
- ICDAR-2009-KhurshidFV #documentation #image #retrieval
- Fusion of Word Spotting and Spatial Information for Figure Caption Retrieval in Historical Document Images (KK, CF, NV), pp. 266–270.
- ICDAR-2009-LouloudisSG #evaluation #novel #segmentation
- A Novel Two Stage Evaluation Methodology for Word Segmentation Techniques (GL, NS, BG), pp. 686–690.
- ICDAR-2009-MoghaddamC #automation #classification #clustering #documentation #image #multi
- Application of Multi-Level Classifiers and Clustering for Automatic Word Spotting in Historical Document Images (RFM, MC), pp. 511–515.
- ICDAR-2009-QuiniouCA #fault #recognition
- Handling Out-of-Vocabulary Words and Recognition Errors Based on Word Linguistic Context for Handwritten Sentence Recognition (SQ, MC, ÉA), pp. 466–470.
- ICDAR-2009-RasagnaKJM #clustering #documentation #recognition #robust
- Robust Recognition of Documents by Fusing Results of Word Clusters (VR, AK, CVJ, RM), pp. 566–570.
- ICDAR-2009-Rodriguez-SerranoP #image #query #retrieval
- Handwritten Word Image Retrieval with Synthesized Typed Queries (JARS, FP), pp. 351–355.
- ICDAR-2009-SharmaKS #online #recognition
- Rearrangement of Recognized Strokes in Online Handwritten Gurmukhi Words Recognition (AS, RK, RKS), pp. 1241–1245.
- ICDAR-2009-TerasawaIT #automation #evaluation #framework
- Automatic Evaluation Framework for Word Spotting (KT, HI, YT), pp. 276–280.
- ICDAR-2009-TerasawaT #documentation #image
- Slit Style HOG Feature for Document Image Word Spotting (KT, YT), pp. 116–120.
- VLDB-2009-DragutFSYM #integration #interface #problem #web
- Stop Word and Related Problems in Web Interface Integration (ECD, FF, APS, CTY, WM), pp. 349–360.
- MSR-2009-Kuhn #automation #component #evolution #source code #using
- Automatic labeling of software components and their evolution using log-likelihood ratio of word frequencies in source code (AK), pp. 175–178.
- MSR-2009-MaalejH #developer #how #question
- From work to word: How do software developers describe their work? (WM, HJH), pp. 121–130.
- DLT-2009-BealP #automaton #bound #clustering #polynomial
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, DP), pp. 81–90.
- DLT-2009-BlakeleyBGR #complexity #on the #set
- On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
- DLT-2009-BucciLL
- Rich and Periodic-Like Words (MB, AdL, ADL), pp. 145–155.
- DLT-2009-CzeizlerCKS #pseudo
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words (EC, EC, LK, SS), pp. 183–194.
- DLT-2009-GlenHK
- Crucial Words for Abelian Powers (AG, BVH, SK), pp. 264–275.
- DLT-2009-KudinovS #order
- Definability in the Infix Order on Words (OVK, VLS), pp. 454–465.
- DLT-2009-LaineP #equation
- Word Equations with One Unknown (ML, WP), pp. 348–359.
- DLT-2009-Meinecke #calculus #μ-calculus
- A Weighted μ-Calculus on Words (IM), pp. 384–395.
- DLT-2009-RestivoR
- Balanced Words Having Simple Burrows-Wheeler Transform (AR, GR), pp. 431–442.
- ICALP-v2-2009-BlumensathOW #bound #finite #higher-order #monad
- Boundedness of Monadic Second-Order Formulae over Finite Words (AB, MO, MW), pp. 67–78.
- LATA-2009-Blanchet-SadriABM #how #question
- How Many Holes Can an Unbordered Partial Word Contain? (FBS, EA, CB, RM), pp. 176–187.
- LATA-2009-Blanchet-SadriMRW #algorithm #using
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (FBS, RM, AR, EW), pp. 188–199.
- LATA-2009-BucciL #image #on the #product line
- On a Family of Morphic Images of Arnoux-Rauzy Words (MB, ADL), pp. 259–266.
- LATA-2009-LisitsaPS #automaton
- Automata on Gauss Words (AL, IP, RS), pp. 505–517.
- LATA-2009-Llull-ChavarriaV #complexity #semantics
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words (JLC, OV), pp. 530–541.
- LATA-2009-Salimov #complexity #infinity
- Constructing Infinite Words of Intermediate Arithmetical Complexity (PVS), pp. 696–701.
- LATA-2009-Salomaa #automaton #complexity
- State Complexity of Nested Word Automata (KS), pp. 59–70.
- DiGRA-2009-LandwehrDC #analysis #relational
- The Words of Warcraft: relational text analysis of quests in an MMORPG (PML, JD, KMC).
- CHI-2009-NewtonKM #comparison #online
- Autism online: a comparison of word usage in bloggers with and without autism spectrum disorders (ATN, ADIK, DNM), pp. 463–466.
- HCI-AUII-2009-VerhoefLBOZC
- Bio-sensing for Emotional Characterization without Word Labels (TV, CLL, AB, FRO, TvdZ, FC), pp. 693–702.
- HCI-NIMT-2009-SadP #modelling #predict
- Modeling Word Selection in Predictive Text Entry (HHS, FP), pp. 725–734.
- HCI-NT-2009-BeeldersBMD #interface #performance #prototype #using
- Measuring User Performance for Different Interfaces Using a Word Processor Prototype (TRB, PJB, TM, ED), pp. 395–404.
- HIMI-DIE-2009-RottermannV
- Reversing the Simon Effect with Prior Practice of Noncorresponding Location Words (AR, KPLV), pp. 287–295.
- OCSC-2009-SongNKE #recommendation #using
- A Proposed Movie Recommendation Method Using Emotional Word Selection (MS, HN, HGK, JE), pp. 525–534.
- CIKM-2009-ClinchantG #constraints #information retrieval
- Retrieval constraints and word frequency distributions: a log-logistic model for IR (SC, ÉG), pp. 1975–1978.
- CIKM-2009-HuangSN #documentation #graph
- Smoothing document language model with local word graph (YH, LS, JYN), pp. 1943–1946.
- CIKM-2009-MartineauFJP #classification #difference #problem #using
- Improving binary classification on text problems using differential word features (JM, TF, AJ, SP), pp. 2019–2024.
- CIKM-2009-MomtaziK #approach #clustering #modelling #retrieval
- A word clustering approach for language model-based sentence retrieval in question answering systems (SM, DK), pp. 1911–1914.
- ECIR-2009-GouveaR #information retrieval
- Word Particles Applied to Information Retrieval (EBG, BR), pp. 424–436.
- KDIR-2009-KulkarniC #concept #semantics #using
- Computation of the Semantic Relatedness between Words using Concept Clouds (SK, DC), pp. 183–188.
- KEOD-2009-Haddad #approach #probability #representation #towards
- Representation of Arabic Words — An Approach Towards Probabilistic Root-Pattern Relationships (BH), pp. 147–152.
- KEOD-2009-LocoroM #algorithm #ambiguity #ontology
- A Correspondence Repair Algorithm based on Word Sense Disambiguation and Upper Ontologies (AL, VM), pp. 239–246.
- SIGIR-2009-YeHL #approach #graph #mining #multi #wiki
- A graph-based approach to mining multilingual word associations from wikipedia (ZY, XH, HL), pp. 690–691.
- MoDELS-2009-BroschLSWWKRS #modelling
- An Example Is Worth a Thousand Words: Composite Operation Modeling By-Example (PB, PL, MS, KW, MW, GK, WR, WS), pp. 271–285.
- MoDELS-2009-BroschLSWWKRS #modelling
- An Example Is Worth a Thousand Words: Composite Operation Modeling By-Example (PB, PL, MS, KW, MW, GK, WR, WS), pp. 271–285.
- CSL-2009-CockettS #communication #on the #problem
- On the Word Problem for ΣΠ-Categories, and the Properties of Two-Way Communication (JRBC, LS), pp. 194–208.
- DRR-2008-BhardwajKSG #approach #documentation
- An OCR based approach for word spotting in Devanagari documents (AB, SK, SS, VG), p. 68150.
- DRR-2008-El-HajjML #modelling #recognition #using
- Recognition of Arabic handwritten words using contextual character models (REH, CM, LLS), p. 681503.
- DRR-2008-HuangS #documentation #segmentation
- Word segmentation of off-line handwritten documents (CH, SNS), p. 68150.
- DRR-2008-Schomaker #mining
- Word mining in a sparsely labeled handwritten collection (LRBS), p. 68150.
- DRR-2008-ZavorinBDBS #classification #recognition
- Combining different classification approaches to improve off-line Arabic handwritten word recognition (IZ, EB, ED, AB, KMS), p. 681504.
- ICPC-2008-SridharaHPV #case study #comparative #identification #semantics #similarity #tool support
- Identifying Word Relations in Software: A Comparative Study of Semantic Similarity Tools (GS, EH, LLP, KVS), pp. 123–132.
- DLT-J-2007-DiekertGK08 #finite #first-order #logic #overview
- A Survey on Small Fragments of First-Order Logic over Finite Words (VD, PG, MK), pp. 513–548.
- AFL-2008-Blanchet-SadriMS
- Counting Distinct Squares in Partial Words (FBS, RM, GS), pp. 122–133.
- AFL-2008-Blanchet-SadriOR
- Computing Weak Periods of Partial Words (FBS, TO, TDR), pp. 134–145.
- AFL-2008-Martyugin #automaton #commutative #complexity #problem
- Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.
- CIAA-2008-BaturoPR
- The Number of Runs in Sturmian Words (PB, MP, WR), pp. 252–261.
- DLT-2008-BassinoGN #complexity #finite #linear #set
- The Average State Complexity of the Star of a Finite Set of Words Is Linear (FB, LG, CN), pp. 134–145.
- DLT-2008-HadravovaH #scalability #similarity
- Large Simple Binary Equality Words (JH, SH), pp. 396–407.
- DLT-2008-HolubN #finite #on the
- On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 408–418.
- DLT-2008-MantaciMR
- Balance Properties and Distribution of Squares in Circular Words (RM, SM, AR), pp. 504–515.
- ICALP-B-2008-Mathissen #algebra #logic
- Weighted Logics for Nested Words and Algebraic Formal Power Series (CM), pp. 221–232.
- LATA-2008-GawrychowskiK
- 2-Synchronizing Words (PG, AK), pp. 221–231.
- LATA-2008-KitaevMS #morphism #order
- Counting Ordered Patterns in Words Generated by Morphisms (SK, TM, PS), pp. 287–298.
- LATA-2008-PhuongHRV #approach #hybrid #segmentation
- A Hybrid Approach to Word Segmentation of Vietnamese Texts (HPL, NTMH, AR, HTV), pp. 240–249.
- LATA-2008-Puzynina #2d #on the
- On Periodicity of Generalized Two-Dimensional Words (SP), pp. 440–451.
- CHI-2008-KramerR #behaviour #modelling
- Word usage and posting behaviors: modeling blogs with unobtrusive data collection methods (ADIK, KR), pp. 1125–1128.
- ECIR-2008-KarlgrenHS
- Filaments of Meaning in Word Space (JK, AH, MS), pp. 531–538.
- ICPR-2008-AssabieB #recognition
- Lexicon-based offline recognition of Amharic words in unconstrained handwritten text (YA, JB), pp. 1–4.
- ICPR-2008-CaoBLLH #classification
- Audio-visual event classification via spatial-temporal-audio words (YC, SB, SHL, ML, SH), pp. 1–5.
- ICPR-2008-CheikhBK #approach #novel #recognition
- A novel approach for the recognition of a wide Arabic handwritten word lexicon (IBC, AB, AK), pp. 1–4.
- ICPR-2008-GarainD #detection #documentation #empirical #image
- Stop word detection in compressed textual images: An experiment on indic script documents (UG, AKD), pp. 1–4.
- ICPR-2008-LongJ #novel #online #recognition
- A novel orientation free method for online unconstrained cursive handwritten chinese word recognition (TL, LJ), pp. 1–4.
- ICPR-2008-RodriguezPSL #adaptation
- Unsupervised writer style adaptation for handwritten word spotting (JAR, FP, GS, JL), pp. 1–4.
- ICPR-2008-ShawPS #approach #recognition #segmentation
- Offline handwritten Devanagari word recognition: A segmentation based approach (BS, SKP, MS), pp. 1–4.
- ICPR-2008-WangLLSX #adaptation #automation #video
- Automatic video annotation with adaptive number of key words (FW, WL, JL, MS, DX), pp. 1–4.
- KDD-2008-SatoYN #graph #information management #parametricity #semantics #using
- Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model (IS, MY, HN), pp. 587–595.
- SIGIR-2008-LiDZS #documentation
- Knowledge transformation from word space to document space (TL, CHQD, YZ, BS), pp. 187–194.
- SIGIR-2008-LiT #documentation #image
- A word shape coding method for camera-based document images (LL, CLT), pp. 771–772.
- SIGIR-2008-Nguyen #approach #preprocessor #query #web
- Query preprocessing: improving web search through a Vietnamese word tokenization approach (DN), pp. 765–766.
- AdaEurope-2008-Evequoz #concurrent #performance #using
- Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives (CE), pp. 59–72.
- SAC-2008-AlmeidaRTG
- Making colors worth more than a thousand words (JA, AR, RdST, SG), pp. 1180–1186.
- SAC-2008-EinseleIH #independence #recognition
- A language-independent, open-vocabulary system based on HMMs for recognition of ultra low resolution words (FE, RI, JH), pp. 429–433.
- SAC-2008-Michelucci #geometry #proving #theorem
- Isometry group, words and proofs of geometric theorems (DM), pp. 1821–1825.
- CAV-2008-Bjesse #approach #industrial #model checking
- A Practical Approach to Word Level Model Checking of Industrial Netlists (PB), pp. 446–458.
- ICDAR-2007-Al-HajjML #classification #recognition
- Combination of HMM-Based Classifiers for the Recognition of Arabic Handwritten Words (RAHM, CM, LLS), pp. 959–963.
- ICDAR-2007-BanerjeeHC #concept #database #documentation #image #query #semantics
- Word image based latent semantic indexing for conceptual querying in document image databases (SB, GH, SC), pp. 1208–1212.
- ICDAR-2007-BharathM #markov #modelling #online #recognition
- Hidden Markov Models for Online Handwritten Tamil Word Recognition (AB, SM), pp. 506–510.
- ICDAR-2007-FathallaEI #image
- Extraction of Arabic Words from Complex Color Image (RF, YES, MAI), pp. 1223–1227.
- ICDAR-2007-HamamuraAI #algorithm #probability #recognition #using
- An Analytic Word Recognition Algorithm Using a Posteriori Probability (TH, TA, BI), pp. 669–673.
- ICDAR-2007-KessentiniPB #approach #multi #recognition
- A Multi-stream Approach to Off-Line Handwritten Word Recognition (YK, TP, ABH), pp. 317–321.
- ICDAR-2007-LladosS #documentation
- Indexing Historical Documents by Word Shape Signatures (JL, GS), pp. 362–366.
- ICDAR-2007-MakridisNG #documentation #performance #segmentation
- An Efficient Word Segmentation Technique for Historical and Degraded Machine-Printed Documents (MM, NAN, BG), pp. 178–182.
- ICDAR-2007-ShettySS #random #recognition #using
- Handwritten Word Recognition Using Conditional Random Fields (SS, HS, SNS), pp. 1098–1102.
- PODS-2007-Alur
- Marrying words and trees (RA), pp. 233–242.
- ITiCSE-2007-Lewis #student #using
- Are pictures worth 1000 words? the use of affective imagery surveys to capture student perceptions of the computing discipline (TLL), p. 312.
- CIAA-J-2006-CzeizlerK07 #equation #independence #on the
- On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns (EC, JK), pp. 873–897.
- DLT-2007-Blanchet-SadriBP #set
- Two Element Unavoidable Sets of Partial Words (FBS, NCB, JP), pp. 96–107.
- DLT-2007-DiekertK #first-order #on the
- On First-Order Fragments for Words and Mazurkiewicz Traces (VD, MK), pp. 1–19.
- DLT-2007-Richomme
- A Local Balance Property of Episturmian Words (GR), pp. 371–381.
- DLT-2007-SciortinoZ #automaton #standard
- Suffix Automata and Standard Sturmian Words (MS, LQZ), pp. 382–398.
- ICALP-2007-ArenasBL #automaton #fixpoint #regular expression
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization (MA, PB, LL), pp. 888–900.
- LATA-2007-BaturoR #standard
- Occurrence and Lexicographic Properties of Standard Sturmian Words (PB, WR), pp. 79–90.
- LATA-2007-Blanchet-SadriCN
- Fine and Wilf’s Periodicity Result on Partial Words and Consequences (FBS, KC, JN), pp. 115–126.
- LATA-2007-Diekert #equation #graph #named
- Equations: From Words to Graph Products (VD), pp. 1–6.
- LATA-2007-DinuGM #automaton #on the
- On the syllabification of words via go-through automata (LPD, RG, FM), pp. 223–236.
- LATA-2007-YoonSK #corpus #rule-based
- Rule-based Word Spacing in Korean Based on Lexical Information Extracted from a Corpus (JY, GYS, SK), pp. 589–599.
- HCI-IPT-2007-ParkJ #automation #detection #documentation #image #mobile #using
- Automatic Word Detection System for Document Image Using Mobile Devices (AP, KJ), pp. 438–444.
- HCI-MIE-2007-DerakhshiK #bound #fuzzy #network #predict #sequence #using
- Using Recurrent Fuzzy Neural Networks for Predicting Word Boundaries in a Phoneme Sequence in Persian Language (MRFD, MRK), pp. 50–59.
- HIMI-MTT-2007-JiGC #comparison #using
- Selecting Target Word Using Contexonym Comparison Method (HJ, BG, HC), pp. 463–470.
- CIKM-2007-PeraN #email #similarity #using
- Using word similarity to eradicate junk emails (MSP, YKN), pp. 943–946.
- CIKM-2007-WangG #image #topic
- Translating topics to words for image annotation (YW, SG), pp. 995–998.
- SIGIR-2007-Kettunen #generative #information retrieval #keyword
- Management of keyword variation with frequency based generation of word forms in IR (KK), pp. 691–692.
- SIGIR-2007-RoussinovFS #detection
- Detecting word substitutions: PMI vs. HMM (DR, SF, DBS), pp. 885–886.
- SAC-2007-TopkaraAT #multi
- Passwords decay, words endure: secure and re-usable multiple password mnemonics (UT, MJA, MT), pp. 292–299.
- DATE-2007-KroeningS #image #interactive #proving #refinement #using
- Interactive presentation: Image computation and predicate refinement for RTL verilog using word level proofs (DK, NS), pp. 1325–1330.
- HPCA-2007-QureshiSP #capacity
- Line Distillation: Increasing Cache Capacity by Filtering Unused Words in Cache Lines (MKQ, MAS, YNP), pp. 250–259.
- SOSP-2007-ChunMSK #memory management
- Attested append-only memory: making adversaries stick to their word (BGC, PM, SS, JK), pp. 189–204.
- CSL-2007-WeisI #strict #theorem
- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words (PW, NI), pp. 343–357.
- LICS-2007-AlurABEIL #first-order #logic
- First-Order and Temporal Logics for Nested Words (RA, MA, PB, KE, NI, LL), pp. 151–160.
- DRR-2006-SrihariSBB #documentation
- Spotting words in handwritten Arabic documents (SNS, HS, PB, CB).
- DLT-J-2005-AnanichevPV06
- Collapsing Words: a Progress Report (DSA, IVP, MVV), pp. 507–518.
- DLT-J-2005-BesC06 #linear #order #theorem
- A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 519–542.
- DLT-J-2005-Pribavkina06 #on the
- On some Properties of the Language of 2-collapsing Words (EVP), pp. 665–676.
- DLT-2006-AlurM
- Adding Nesting Structure to Words (RA, PM), pp. 1–13.
- DLT-2006-Borel #3d #complexity
- Complexity of Degenerated Three Dimensional Billiard Words (JPB), pp. 386–396.
- DLT-2006-DrosteR #automaton #infinity #logic
- Weighted Automata and Weighted Logics on Infinite Words (MD, GR), pp. 49–58.
- ICGT-2006-RiedlSF #generative #graph grammar #order #strict #string
- String Generating Hypergraph Grammars with Word Order Restrictions (MR, SS, IF), pp. 138–152.
- CHI-2006-PearsonHBPN #adaptation #behaviour #how #human-computer
- Adaptive language behavior in HCI: how expectations and beliefs about a system affect users’ word choice (JP, JH, HPB, MJP, CN), pp. 1177–1180.
- ICPR-v1-2006-MillerW #analysis #semantics
- Word Completion with Latent Semantic Analysis (TM, EW), pp. 1252–1255.
- ICPR-v2-2006-BenouarethES #recognition
- HMMs with Explicit State Duration Applied to Handwritten Arabic Word Recognition (AB, AE, MS), pp. 897–900.
- ICPR-v2-2006-GatosPP #hybrid #recognition
- Hybrid Off-Line Cursive Handwriting Word Recognition (BG, IP, SJP), pp. 998–1002.
- ICPR-v2-2006-LiwickiSB #online
- Word Extraction from On-Line Handwritten Text Lines (ML, MS, HB), pp. 929–933.
- ICPR-v2-2006-SharmaL #algorithm #segmentation
- An Iterative Algorithm for Segmentation of Isolated Handwritten Words in Gurmukhi Script (DVS, GSL), pp. 1022–1025.
- ICPR-v2-2006-YaoDL #online #recognition
- On-line handwritten Chinese word recognition based on lexicon (ZY, XD, CL), pp. 320–323.
- ICPR-v3-2006-HalavatiSTCR #approach #novel #performance #recognition #robust #speech
- A Novel Approach to Very Fast and Noise Robust, Isolated Word Speech Recognition (RH, SBS, HT, AC, MR), pp. 190–193.
- SAC-2006-BaralisG #categorisation
- Associative text categorization exploiting negated words (EB, PG), pp. 530–535.
- SAC-2006-PirkolaTKJ #named #quality
- FITE-TRT: a high quality translation technique for OOV words (AP, JT, HK, KJ), pp. 1043–1049.
- STOC-2006-Plandowski #algorithm #equation #performance
- An efficient algorithm for solving word equations (WP), pp. 467–476.
- CAV-2006-EisingerK #approach
- Don’t Care Words with an Application to the Automata-Based Approach for Real Addition (JE, FK), pp. 67–80.
- CSL-2006-Segoufin #automaton #infinity #logic
- Automata and Logics for Words and Trees over an Infinite Alphabet (LS), pp. 41–57.
- LICS-2006-BojanczykMSSD #logic
- Two-Variable Logic on Words with Data (MB, AM, TS, LS, CD), pp. 7–16.
- ICDAR-2005-ChengB #heuristic #segmentation #using
- The Neural-based Segmentation of Cursive Words using Enhanced Heuristics (CKC, MB), pp. 650–654.
- ICDAR-2005-DongPKS
- Cursive word skew/slant corrections based on Radon transform (JxD, DP, AK, CYS), pp. 478–483.
- ICDAR-2005-FarahEKS #classification #multi #recognition
- Benefit of multiclassifier systems for Arabic handwritten words recognition (NF, AE, TK, MS), pp. 222–226.
- ICDAR-2005-HaritJC #geometry #graph #image #independence #representation #retrieval
- Improved Geometric Feature Graph: A Script Independent Representation of Word Images for Compression, and Retrieval (GH, RJ, SC), pp. 421–425.
- ICDAR-2005-HottaTSN #recognition
- Accuracy Improvement for Handwritten Japanese Word Recognition by Combination of Character and Word Recognizer (YH, HT, MS, SN), pp. 685–689.
- ICDAR-2005-KanounAL #approach #recognition #validation
- Affixal Approach for Arabic Decomposable Vocabulary Recognition: A Validation on Printed Word in Only One Font (SK, AMA, YL), pp. 1025–1029.
- ICDAR-2005-LeeI #performance #recognition
- A Simple and Efficient Method for Global Handwritten Word Recognition Applied to Brazilian Bankchecks (LLL, SI), pp. 950–955.
- ICDAR-2005-NwoguK
- Word Separation of Unconstrained Handwritten Text Lines in PCR Forms (IN, GK), pp. 715–719.
- ICDAR-2005-Schambach #performance #recognition #scalability
- Fast Script Word Recognition with Very Large Vocabulary (MPS), pp. 9–13.
- ICDAR-2005-Sherkat #recognition
- Influence of Zoning on Whole Word Recognition (NS), pp. 1085–1089.
- ICDAR-2005-ShivakumaraKVRN #documentation #estimation #image #using
- A New Moments based Skew Estimation Technique using Pixels in the Word for Binary Document Images (PS, GHK, HSV, SR, MRRN), pp. 151–156.
- ICDAR-2005-VajdaB #recognition
- Structural Information Implant in a Context Based Segmentation-Free HMM Handwritten Word Recognition System for Latin and Bangla Script (SV, AB), pp. 1126–1130.
- DLT-J-2004-Rampersad05 #morphism
- Words avoiding 7/3-powers and the thue-morse morphism (NR), pp. 755–766.
- CIAA-2005-Rytter #fibonacci #graph
- The Structure of Subword Graphs and Suffix Trees of Fibonacci Words (WR), pp. 250–261.
- DLT-2005-AnanichevPV
- Collapsing Words: A Progress Report (DSA, IVP, MVV), pp. 11–21.
- DLT-2005-AraujoB
- Sturmian Words: Dynamical Systems and Derivated Words (IMA, VB), pp. 122–133.
- DLT-2005-BedonR #linear #order #theorem
- Schützenberger and Eilenberg Theorems for Words on Linear Orderings (NB, CR), pp. 134–145.
- DLT-2005-BesC #linear #order #theorem
- A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 158–167.
- DLT-2005-BorelR
- Some New Results on Palindromic Factors of Billiard Words (JPB, CR), pp. 180–188.
- DLT-2005-CarpiL
- Central Sturmian Words: Recent Developments (AC, AdL), pp. 36–56.
- DLT-2005-KariKST #on the
- On Hairpin-Free Words and Languages (LK, SK, PS, GT), pp. 296–307.
- DLT-2005-LucaL
- Palindromes in Sturmian Words (AdL, ADL), pp. 199–208.
- DLT-2005-Pribavkina #on the
- On Some Properties of the Language of 2-Collapsing Words (EVP), pp. 374–384.
- ICALP-2005-KaoSS #design #performance #random
- Randomized Fast Design of Short DNA Words (MYK, MS, RTS), pp. 1275–1286.
- CIKM-2005-Ahonen-Myka #mining #sequence #set
- Mining all maximal frequent word sequences in a set of sentences (HAM), pp. 255–256.
- CIKM-2005-LiC #clustering #documentation #sequence
- Text document clustering based on frequent word sequences (YL, SMC), pp. 293–294.
- CIKM-2005-LiuYM #ambiguity #query
- Word sense disambiguation in queries (SL, CTY, WM), pp. 525–532.
- ICML-2005-MadsenKE #modelling #using
- Modeling word burstiness using the Dirichlet distribution (REM, DK, CE), pp. 545–552.
- MLDM-2005-DongKSP #composition #geometry #low level #representation
- Low-Level Cursive Word Representation Based on Geometric Decomposition (JxD, AK, CYS, DP), pp. 590–599.
- MLDM-2005-LeHS #ambiguity #approach #classification #reasoning
- An Evidential Reasoning Approach to Weighted Combination of Classifiers for Word Sense Disambiguation (CAL, VNH, AS), pp. 516–525.
- SIGIR-2005-GaoNB #modelling
- Integrating word relationships into language models (GC, JYN, JB), pp. 298–305.
- SIGIR-2005-HoweRM #documentation #recognition #retrieval
- Boosted decision trees for word recognition in handwritten document retrieval (NRH, TMR, RM), pp. 377–383.
- SIGIR-2005-McNameeM
- Translating pieces of words (PM, JM), pp. 643–644.
- SAC-2005-HanMZTGZ #clustering #documentation #metadata #rule-based
- Rule-based word clustering for document metadata extraction (HH, EM, HZ, KT, CLG, XZ), pp. 1049–1053.
- DAC-2005-JainKSC #abstraction #refinement #verification
- Word level predicate abstraction and refinement for verifying RTL verilog (HJ, DK, NS, EMC), pp. 445–450.
- TACAS-2005-KupfermanV #automaton #infinity #nondeterminism
- Complementation Constructions for Nondeterministic Automata on Infinite Words (OK, MYV), pp. 206–221.
- DRR-2004-MaD #documentation #identification #image
- Word level script identification for scanned document images (HM, DSD), pp. 124–135.
- DRR-2004-ZhangSH #image #retrieval #using
- Word image retrieval using binary features (BZ, SNS, CH), pp. 45–53.
- DLT-2004-Rampersad #morphism
- Words Avoiding 7/3-Powers and the Thue-Morse Morphism (NR), pp. 357–367.
- ICALP-2004-DabrowskiP #equation
- Solving Two-Variable Word Equations (RD, WP), pp. 408–419.
- ICALP-2004-Lohrey #problem
- Word Problems on Compressed Words (ML), pp. 906–918.
- CSCW-2004-SunXSC #collaboration
- Operational transformation for collaborative word processing (DS, SX, CS, DC), pp. 437–446.
- ECIR-2004-CloughS04a #ambiguity #information retrieval #using
- Cross-Language Information Retrieval Using EuroWordNet and Word Sense Disambiguation (PDC, MS), pp. 327–337.
- ICML-2004-ToutanovaMN #dependence #learning #modelling #random
- Learning random walk models for inducing word dependency distributions (KT, CDM, AYN).
- ICPR-v1-2004-GunterB #evaluation #feature model #recognition
- An Evaluation of Ensemble Methods in Handwritten Word Recognition Based on Feature Selection (SG, HB), pp. 388–392.
- ICPR-v2-2004-MaD #adaptation #classification #using
- Adaptive Word Style Classification Using a Gaussian Mixture Model (HM, DSD), pp. 606–609.
- ICPR-v2-2004-TomaiZS #power of #recognition
- Discriminatory Power of Handwritten Words for Writer Recognition (CIT, BZ, SNS), pp. 638–641.
- ICPR-v4-2004-ZhangLT #analysis #image #recognition #using
- Italic Font Recognition Using Stroke Pattern Analysis on Wavelet Decomposed Word Images (LZ, YL, CLT), pp. 835–838.
- SIGIR-2004-KimSR #approach #information retrieval #using
- Information retrieval using word senses: root sense tagging approach (SBK, HCS, HCR), pp. 258–265.
- IJCAR-2004-BaaderGT #decidability #logic #problem
- A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics (FB, SG, CT), pp. 183–197.
- ICDAR-2003-CarbonnelA #optimisation #recognition
- Lexical Post-Processing Optimization for Handwritten Word Recognition (SC, ÉA), pp. 477–481.
- ICDAR-2003-ChoisyB #markov #network #recognition
- Coupling of a local vision by Markov field and a global vision by Neural Network for the recognition of handwritten words (CC, AB), pp. 849–853.
- ICDAR-2003-FeldbachT #documentation #segmentation #semantics
- Word Segmentation of Handwritten Dates in Historical Documents by Combining Semantic A-Priori-Knowledge with Local Features (MF, KDT), pp. 333–337.
- ICDAR-2003-GunterB #optimisation
- Optimizing the Number of States, Training Iterations and Gaussians in an HMM-based Handwritten Word Recognizer (SG, HB), pp. 472–476.
- ICDAR-2003-IshideraN #case study #generative #image #recognition #top-down
- A Study on Top-down Word Image Generation for Handwritten Word Recognition (EI, DN), pp. 1173–1177.
- ICDAR-2003-KavallieratouSFK #recognition
- Handwritten Word Recognition based on Structural Characteristics and Lexical Support (EK, KNS, NF, GKK), pp. 562–566.
- ICDAR-2003-KimMO #algorithm #classification #statistics
- A Text Watermarking Algorithm based on Word Classification and Inter-word Space Statistics (YWK, KAM, ISO), pp. 775–779.
- ICDAR-2003-LiuS #recognition
- A Format-Driven Handwritten Word Recognition System (XL, ZS), pp. 1118–1122.
- ICDAR-2003-LucasPD #image #performance #recognition
- Fast Lexicon-Based Word Recognition in Noisy Index Card Images (SML, GP, ACD), pp. 462–466.
- ICDAR-2003-LuT #documentation #image
- Word Searching in CCITT Group 4 Compressed Document Images (YL, CLT), pp. 467–471.
- ICDAR-2003-MarinaiMS #documentation #retrieval
- Indexing and retrieval of words in old documents (SM, EM, GS), pp. 223–227.
- ICDAR-2003-MoritaSBS #recognition #verification
- A Recognition and Verification Strategy for Handwritten Word Recognition (MEM, RS, FB, CYS), p. 482–?.
- ICDAR-2003-MoritaSBS03a #algorithm #feature model #multi #recognition #search-based #using
- Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition (MEM, RS, FB, CYS), pp. 666–670.
- ICDAR-2003-PechwitzM #approach #database #recognition #using
- HMM Based Approach for Handwritten Arabic Word Recognition Using the IFN/ENIT- Database (MP, VM), pp. 890–894.
- ICDAR-2003-RathM
- Features for Word Spotting in Historical Manuscripts (TMR, RM), pp. 218–222.
- ICDAR-2003-RyuK #learning #recognition
- Learning the lexicon from raw texts for open-vocabulary Korean word recognition (SR, JHK), pp. 202–206.
- ICDAR-2003-Schambach #adaptation #recognition
- Model Length Adaptation of an HMM based Cursive Word Recognition System (MPS), pp. 109–113.
- ICDAR-2003-Schambach03a #recognition
- Determination of the Number of Writing Variants with an HMM based Cursive Word Recognition System (MPS), p. 119–?.
- ICDAR-2003-ZhangS #analysis #using
- Analysis of Handwriting Individuality Using Word Features (BZ, SNS), pp. 1142–1146.
- CIAA-2003-Karhumaki #automaton
- Automata on Words (JK), pp. 3–10.
- CIAA-2003-MiyamotoITS #graph
- Ternary Directed Acyclic Word Graphs (SM, SI, MT, AS), pp. 120–130.
- SIGIR-2003-HanMGZ #classification #clustering #rule-based
- Rule-based word clustering for text classification (HH, EM, CLG, HZ), pp. 445–446.
- SIGIR-2003-JonesF #predict #query
- Query word deletion prediction (RJ, DCF), pp. 435–436.
- SIGIR-2003-StokoeOT #ambiguity #information retrieval #revisited
- Word sense disambiguation in information retrieval revisited (CS, MPO, JT), pp. 159–166.
- ICLP-2003-MoonMHK #ambiguity #integration #network #semantics
- Integration of Semantic Networks for Corpus-Based Word Sense Disambiguation (YJM, KM, YH, PK), pp. 492–493.
- ECDL-2002-SerralheiroCMT #using
- Word Alignment in Digital Talking Books Using WFSTs (AJS, DC, HM, IT), pp. 508–515.
- DLT-2002-AnanichevCV #algorithm #automaton
- An Inverse Automata Algorithm for Recognizing 2-Collapsing Words (DSA, AC, MVV), pp. 270–282.
- DLT-2002-BassinoCN #standard
- The Average Lengths of the Factors of the Standard Factorization of Lyndon Words (FB, JC, CN), pp. 307–318.
- DLT-2002-Cassaigne #complexity #infinity
- Constructing Infinite Words of Intermediate Complexity (JC), pp. 173–184.
- DLT-2002-CurrieF
- Circular Words Avoiding Patterns (JDC, DSF), pp. 319–325.
- DLT-2002-Esik #finite #generative #logic #monad
- Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators (ZÉ), pp. 43–58.
- CGDC-2002-Costikyan #design #game studies #towards
- I Have No Words & I Must Design: Toward a Critical Vocabulary for Games (GC).
- ICEIS-2002-Rodriguez-Luna #process
- Stemming Process in Spanish Words with the Successor Variety Method. Methodology and Result (MRL), pp. 838–842.
- ICML-2002-Mladenic #learning #normalisation #using
- Learning word normalization using word suffix and context from unlabeled data (DM), pp. 427–434.
- ICPR-v2-2002-KimJKS #clustering #detection #segmentation
- Word Segmentation of Printed Text Lines Based on Gap Clustering and Special Symbol Detection (SHK, CBJ, HKK, CYS), pp. 320–323.
- ICPR-v3-2002-Al-MaadeedHE #approach #markov #recognition #using
- Recognition of Off-Line Handwritten Arabic Words Using Hidden Markov Model Approach (SAM, CH, DE), pp. 481–484.
- ICPR-v3-2002-Al-OhaliCS02a #estimation #performance
- Efficient Estimation of Pen Trajectory from Off-Line Handwritten Words (YAO, MC, CYS), pp. 323–326.
- ICPR-v3-2002-IshideraLD #generative #image #recognition
- Likelihood Word Image Generation Model for Word Recognition (EI, SML, ACD), pp. 172–175.
- ICPR-v3-2002-LuT #analysis #documentation #image #layout
- Word Spotting in Chinese Document Images without Layout Analysis (YL, CLT), pp. 57–60.
- ICPR-v3-2002-VinciarelliB #markov #modelling #recognition #using
- Offline Cursive Word Recognition using Continuous Density Hidden Markov Models Trained with PCA or ICA Features (AV, SB), pp. 81–84.
- ICPR-v3-2002-WangBR #classification #recognition
- Combining HMM-Based Two-Pass Classifiers for Off-Line Word Recognition (WW, AB, GR), pp. 151–154.
- ICPR-v3-2002-XueG #classification #performance #predict
- Performance Prediction for Handwritten Word Recognizers and Its Application to Classifier Combination (HX, VG), pp. 241–244.
- KDD-2002-DhillonMK #classification #clustering
- Enhanced word clustering for hierarchical text classification (ISD, SM, RK), pp. 191–200.
- KDD-2002-PantelL
- Discovering word senses from text (PP, DL), pp. 613–619.
- SIGIR-2002-PengHSCR #information retrieval #segmentation #self #using
- Using self-supervised word segmentation in Chinese information retrieval (FP, XH, DS, NC, SER), pp. 349–350.
- ICDAR-2001-El-NasanVN
- Word Discrimination Based on Bigram Co-Occurrences (AEN, SV, GN), pp. 149–153.
- ICDAR-2001-EllimanS #database #generative
- A Truthing Tool for Generating a Database of Cursive Words (DE, NS), p. 1255–?.
- ICDAR-2001-FreitasBS #approach #recognition #set #validation
- Handwritten Isolated Word Recognition: An Approach Based on Mutual Information for Feature Set Validation (COdAF, FB, RS), pp. 665–669.
- ICDAR-2001-KimSJL #clustering #segmentation
- Word Segmentation in Handwritten Korean Text Lines Based on Gap Clustering Techniques (SHK, CYS, SJ, GL), pp. 189–193.
- ICDAR-2001-KoerichSS #distributed #problem #recognition #scalability
- A Distributed Scheme for Lexicon-Driven Handwritten Word Recognition and its Application to Large Vocabulary Problems (ALK, RS, CYS), pp. 660–664.
- ICDAR-2001-KoshinakaNY #dependence #probability #recognition #using
- A Stochastic Model for Handwritten Word Recognition Using Context Dependency Between Character Patterns (TK, DN, KY), pp. 154–158.
- ICDAR-2001-KwokP #adaptation #recognition
- Adaptive N-Best List Handwritten Word Recognition (TK, MPP), pp. 168–173.
- ICDAR-2001-LooT #detection
- Detection of Word Groups Based on Irregular Pyramid (PKL, CLT), pp. 200–204.
- ICDAR-2001-LucasTCDR #recognition #robust
- Robust Word Recognition for Museum Archive Card Indexing (SML, ACT, SJC, ACD, SR), pp. 144–148.
- ICDAR-2001-LuTHF #approach #distance #image
- An Approach to Word Image Matching Based on Weighted Hausforff Distance (YL, CLT, WH, LF), pp. 921–925.
- ICDAR-2001-MartiB #independence #recognition #segmentation
- Text Line Segmentation and Word Recognition in a System for General Writer Independent Handwriting Recognition (UVM, HB), pp. 159–163.
- ICDAR-2001-MoritaSEBS #recognition
- Handwritten Month Word Recognition on Brazilian Bank Checks (MEM, RS, MAEY, FB, CYS), pp. 972–976.
- ICDAR-2001-TayKLKV #recognition
- An Analytical Handwritten Word Recognition System with Word-level Discriminant Training (YHT, MK, PML, SK, CVG), pp. 726–730.
- ICDAR-2001-TulyakovG #probability #recognition #segmentation
- Probabilistic Model for Segmentation Based Word Recognition with Lexicon (ST, VG), pp. 164–167.
- JCDL-2001-DellerGS
- Audio watermarking techniques for the national gallery of the spoken word (JRD, AG, MSS), pp. 237–238.
- JCDL-2001-HansenDS
- Transcript-free search of audio archives for the national gallery of the spoken word (JHLH, JRD, MSS), pp. 235–236.
- DLT-2001-AnanichevV
- Collapsing Words vs. Synchronizing Words (DSA, MVV), pp. 166–174.
- DLT-2001-Prodinger #permutation
- Words, Permutations, and Representations of Numbers (HP), pp. 81–99.
- DLT-2001-RestivoS
- Words and Patterns (AR, SS), pp. 117–129.
- CIKM-2001-AmirES #roadmap
- Advances in Phonetic Word Spotting (AA, AE, SS), pp. 580–582.
- ICML-2001-JinH #approach #information retrieval #learning
- Learning to Select Good Title Words: An New Approach based on Reverse Information Retrieval (RJ, AGH), pp. 242–249.
- KDD-2001-Dhillon #clustering #documentation #graph #using
- Co-clustering documents and words using bipartite spectral graph partitioning (ISD), pp. 269–274.
- SIGIR-2001-LawrieCR #summary #topic
- Finding Topic Words for Hierarchical Summarization (DL, WBC, ALR), pp. 349–357.
- SIGIR-2001-WenZN #clustering #feedback #query #using
- Query Clustering Using Content Words and User Feedback (JRW, HZ, JYN), pp. 442–443.
- FoSSaCS-2001-KingKV #automaton #complexity #on the
- On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.
- LICS-2001-Ganzinger #concept #decidability #problem #semantics
- Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems (HG), pp. 81–90.
- ADL-2000-Crestani #fault #query #recognition
- Effects of Word Recognition Errors in Spoken Query Processing (FC), pp. 39–47.
- CIAA-2000-DvorskyS #random
- Word Random Access Compression (JD, VS), pp. 331–332.
- ICALP-2000-BealC #infinity #transducer
- Determinization of Transducers over Infinite Words (MPB, OC), pp. 561–570.
- ICALP-2000-Hagerup #ram
- Improved Shortest Paths on the Word RAM (TH), pp. 61–72.
- WLC-2000-AvgustinovichFF #complexity #infinity
- Arithmetical Complexity of Infinite Words (SVA, DFDF, AEF), pp. 51–62.
- WLC-2000-Carton
- R-Trivial Languages of Words on Countable Ordinals (OC), pp. 88–102.
- WLC-2000-MargolisPV #image
- Words Guaranteeing Minimal Image (SWM, JÉP, MVV), pp. 297–310.
- WLC-2000-SchottS #algorithm #parallel
- Two Optimal Parallel Algorithms on the Commutation Class of a Word (RS, JCS), pp. 403–419.
- RTA-2000-Lohrey #confluence #problem #strict
- Word Problems and Confluence Problems for Restricted Semi-Thue Systems (ML), pp. 172–186.
- RTA-2000-Statman #combinator #on the #problem
- On the Word Problem for Combinators (RS), pp. 203–213.
- ICPR-v1-2000-BojovicS #markov #modelling #recognition
- Training of Hidden Markov Models for Cursive Handwritten Word Recognition (MB, MDS), pp. 1973–1976.
- ICPR-v2-2000-DehghanFAS #fuzzy #markov #modelling #recognition #using
- Off-Line Unconstrained Farsi Handwritten Word Recognition Using Fuzzy Vector Quantization and Hidden Markov Word Models (MD, KF, MA, MS), pp. 2351–2354.
- ICPR-v2-2000-KimKNS #classification #recognition
- A Methodology of Combining HMM and MLP Classifiers for Cursive Word Recognition (JHK, KKK, CPN, CYS), pp. 2319–2322.
- ICPR-v3-2000-SanchisVJ #performance #recognition #speech #using #verification
- Efficient Use of the Grammar Scale Factor to Classify Incorrect Words in Speech Recognition Verification (AS, EV, VMJ), pp. 3278–3281.
- ICPR-v4-2000-DingKMS #estimation
- Accuracy Improvement of Slant Estimation for Handwritten Words (YD, FK, YM, MS), pp. 4527–4530.
- ICPR-v4-2000-KhorsheedC #multi #recognition #using
- Multi-Font Arabic Word Recognition Using Spectral Features (MSK, WFC), pp. 4543–4546.
- ICPR-v4-2000-WangHP #approach #segmentation #statistics
- Statistical-Based Approach to Word Segmentation (YW, RMH, ITP), pp. 4555–4558.
- SIGIR-2000-FranzM #documentation
- Word document density and relevance scoring (MF, JSM), pp. 345–347.
- SIGIR-2000-SlonimT #clustering #documentation #using
- Document clustering using word clusters via the information bottleneck method (NS, NT), pp. 208–215.
- SIGIR-2000-WoodlandJJJ #documentation #retrieval
- Effects of out of vocabulary words in spoken document retrieval (PCW, SEJ, PJ, KSJ), pp. 372–374.
- FoSSaCS-2000-Caucal #on the #term rewriting
- On Word Rewriting Systems Having a Rational Derivation (DC), pp. 48–62.
- ICDAR-1999-BlumensteinV #benchmark #database #metric #recognition #segmentation
- Neural-based Solutions for the Segmentation and Recognition of Difficult Handwritten Words from a Benchmark Database (MB, BV), pp. 281–284.
- ICDAR-1999-DehkordiSW #approach #classification #component
- A Principal Component Approach to Classification of Handwritten Words (MED, NS, RJW), pp. 781–784.
- ICDAR-1999-DingKMS #estimation #evaluation
- Evaluation and Improvement of Slant Estimation for Handwritten Words (YD, FK, YM, MS), pp. 753–756.
- ICDAR-1999-GrandidierSYGS #recognition
- Influence of Word Length on Handwriting Recognition (FG, RS, MAEY, MG, CYS), pp. 777–780.
- ICDAR-1999-Ho #identification #keyword #learning #performance
- Fast Identification of Stop Words for Font Learning and Keyword Spotting (TKH), pp. 333–336.
- ICDAR-1999-KimJS #approach #recognition
- A Lexicon Driven Approach for Off-line Recognition of Unconstrained Handwritten Korean Words (SHK, SJ, CYS), pp. 507–510.
- ICDAR-1999-LohakanAS #segmentation
- Single-character Segmentation for Handprinted Thai Word (ML, SA, MS), pp. 661–664.
- ICDAR-1999-ParkGS #performance #recognition #segmentation
- Efficient Word Segmentation Driven by Unconstrained Handwritten Phrase Recognition (JP, VG, SNS), pp. 605–608.
- ICDAR-1999-SherkatA #image #recognition
- Whole Word Recognition in Facsimile Images (NS, TJA), pp. 547–550.
- ICDAR-1999-WimmerDG #recognition #taxonomy
- Dictionary Preselection in a Neuro-Markovian Word Recognition System (ZW, BD, PG), pp. 539–542.
- ITiCSE-1999-Impagliazzo #architecture #education #scalability
- Teaching very large instruction word architectures (JI), p. 208.
- DLT-1999-Manuch
- Characterization of a word by its subwords (JM), pp. 210–219.
- ICALP-1999-Lepisto
- Relations between Local and Global Periodicity of Words (AL), pp. 534–543.
- WIA-1999-Daciuk
- Treatment of Unknown Words (JD), pp. 71–80.
- RTA-1999-BaaderT #equation #problem
- Deciding the Word Problem in the Union of Equational Theories Sharing Constructors (FB, CT), pp. 175–189.
- HCI-CCAD-1999-FujishigeJK #automaton #finite #recognition #using
- Recognition of Japanese sign language words using finite automata (EF, KJ, TK), pp. 167–171.
- HCI-EI-1999-PentlandRW #adaptation #gesture #interface #learning
- Perceptual Intelligence: learning gestures and words for individualized, adaptive interfaces (AP, DR, CRW), pp. 286–290.
- CIKM-1999-ChiDL #documentation #framework #recognition #segmentation #web
- Word Segmentation and Recognition for Web Document Framework (CHC, C(D, AL), pp. 458–465.
- STOC-1999-Plandowski #equation #satisfiability
- Satisfiability of Word Equations with Constants is in NEXPTIME (WP), pp. 721–725.
- ICALP-1998-KarhumakiLP #behaviour #infinity
- Locally Periodic Infinite Words and a Chaotic Behaviour (JK, AL, WP), pp. 421–430.
- ICALP-1998-PlandowskiR #encoding #equation
- Application of Lempel-Ziv Encodings to the Solution of Words Equations (WP, WR), pp. 731–742.
- WIA-1998-Augros #automaton #finite #infinity #set
- Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.
- ICPR-1998-ChaudhuriG #automation #detection #documentation #image
- Automatic detection of italic, bold and all-capital words in document images (BBC, UG), pp. 610–612.
- ICPR-1998-El-YacoubiSGS #architecture #recognition
- Improved model architecture and training phase in an off-line HMM-based word recognition system (AEY, RS, MG, CYS), pp. 1521–1525.
- ICPR-1998-GuillevicS #recognition
- HMM-KNN word recognition engine for bank cheque processing (DG, CYS), pp. 1526–1529.
- ICPR-1998-Ho98a #recognition
- Bootstrapping text recognition from stop words (TKH), pp. 605–609.
- ICPR-1998-KnerrA #hybrid #markov #recognition
- A neural network-hidden Markov model hybrid for cursive word recognition (SK, EA), pp. 1518–1520.
- ICPR-1998-SinhaM #multi #optimisation #recognition
- Combining multiple OCRs for optimizing word recognition (PS, JM), pp. 436–438.
- SIGIR-1998-BakerM #classification #clustering
- Distributional Clustering of Words for Text Classification (LDB, AM), pp. 96–103.
- STOC-1998-TherienW #quantifier
- Over Words, Two Variables Are as Powerful as One Quantifier Alternation (DT, TW), pp. 234–240.
- DL-1997-WitbrockH #documentation #information retrieval #performance #string #using
- Using Words and Phonetic Strings for Efficient Information Retrieval from Imperfectly Transcribed Spoken Documents (MJW, AGH), pp. 30–35.
- HT-1997-Glazier #hypermedia #quote #web
- “Our Words Were the Form We Entered”: A Model of World Wide Web Hypertext (LPG), pp. 24–28.
- ICDAR-1997-BunkeAKHSSE #online #recognition
- Recovery of temporal information of cursively handwritten words for on-line recognition (HB, RA, GK, TMH, MS, RS, FE), pp. 931–935.
- ICDAR-1997-Favata #approximate #recognition #string #using
- General word recognition using approximate segment-string matching (JTF), pp. 92–96.
- ICDAR-1997-GuillevicS #recognition
- HMM Word Recognition Engine (DG, CYS), pp. 544–547.
- ICDAR-1997-IshideraNY #recognition #using
- Unconstrained Japanese Address Recognition Using a Combination of Spatial Information and Word Knowledge (EI, DN, KY), p. 1016–?.
- ICDAR-1997-KimuraKMS #recognition
- Machine and Human Recognition of Segmented Characters from Handwritten Words (FK, NK, YM, MS), p. 866–?.
- ICDAR-1997-MadhvanathG #image #preprocessor #recognition
- Contour-based Image Preprocessing for Holistic Handwritten Word Recognition (SM, VG), pp. 536–539.
- ICDAR-1997-MadhvanathK #scalability #using
- Pruning Large Lexicons Using Generalized Word Shape Descriptors (SM, VK), pp. 552–555.
- ICDAR-1997-NavoniCCGKR #memory management #recognition #using
- Words Recognition using Associative Memory (LN, RC, MC, GG, AK, PLR), pp. 97–101.
- ICDAR-1997-NgCW
- Dynamic word based text compression (KSN, LMC, CHW), pp. 412–416.
- ICDAR-1997-NobileBSK #documentation #identification #online #using
- Language identification of on-line documents using word shapes (NN, SB, CYS, SK), pp. 258–262.
- ICDAR-1997-PalC #automation #documentation #multi
- Automatic Separation of Words in Multi-lingual Multi-script Indian Documents (UP, BBC), pp. 576–579.
- ICDAR-1997-ShridharHK #recognition #using
- Handwritten Word Recognition Using Lexicon Free and Lexicon Directed Word (MS, GFH, FK), pp. 861–865.
- ICDAR-1997-SudaBKM #approach #using
- Logo and Word Matching Using a General Approach to Signal Registration (PS, CB, BK, GM), p. 61–?.
- DLT-1997-Ilie #order
- Remarks on Well Quasi Orders of Words (LI), pp. 399–409.
- DLT-1997-Moshkov #complexity #nondeterminism #recognition #regular expression
- Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition (MM), pp. 343–349.
- ICALP-1997-KarhumakiPM #equation
- The Expressibility of Languages and Relations by Word Equations (JK, WP, FM), pp. 98–109.
- ICALP-1997-NarendranO #confluence #decidability #finite #problem #string #term rewriting
- The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent (PN, FO), pp. 638–648.
- RTA-1997-OttoKK #decidability #monad #problem
- Cross-Sections for Finitely Presented Monoids with Decidable Word Problems (FO, MK, YK), pp. 53–67.
- RTA-1997-Struth #for free #on the #problem
- On the Word Problem for Free Lattices (GS), pp. 128–141.
- CIKM-1997-FrenchPS #approximate #information retrieval
- Applications of Approximate Word Matching in Information Retrieval (JCF, ALP, ES), pp. 9–15.
- ICML-1997-KollerS #documentation #using
- Hierarchically Classifying Documents Using Very Few Words (DK, MS), pp. 170–178.
- SIGIR-1997-OgawaM #statistics
- Overlapping Statistical Word Indexing: A New Indexing Method for Japanese Text (YO, TM), pp. 226–234.
- CADE-1997-BaaderT #approach #problem
- A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method (FB, CT), pp. 19–33.
- DL-1996-ManmathaHRC #using
- Indexing Handwriting Using Word Matching (RM, CH, EMR, WBC), pp. 151–159.
- HT-1996-Tolva
- Ut Pictura Hyperpoesis: Spatial Form, Visuality, and the Digital Word (JT), pp. 66–73.
- CHI-1996-PageJAA
- User Customization of a Word Processor (SRP, TJJ, UA, CDA), pp. 340–346.
- ICML-1996-AbeL #learning #modelling #using
- Learning Word Association Norms Using Tree Cut Pair Models (NA, HL), pp. 3–11.
- ICPR-1996-Garcia-SalicettiDGW #adaptation #online #predict #recognition
- Adaptive discrimination in an HMM-based neural predictive system for on-line word recognition (SGS, BD, PG, ZW), pp. 515–519.
- ICPR-1996-OlivierMRL #segmentation
- Segmentation and coding of Arabic handwritten words (CO, HM, KRP, YL), pp. 264–268.
- SIGIR-1996-SmeatonQ #image #retrieval #semantics #using
- Experiments on Using Semantic Distances Between Words in Image Caption Retrieval (AFS, IQ), pp. 174–180.
- DAC-1996-ClarkeKZ #fault #model checking
- Word Level Model Checking — Avoiding the Pentium FDIV Error (EMC, MK, XZ), pp. 645–648.
- LICS-1996-KupfermanSV #automaton
- Relating Word and Tree Automata (OK, SS, MYV), pp. 322–332.
- ICDAR-v1-1995-Al-BadrH #recognition
- Segmentation-free word recognition with application to Arabic (BAB, RMH), pp. 355–359.
- ICDAR-v1-1995-FangH #algorithm #approach #recognition #testing #using
- A hypothesis testing approach to word recognition using an A* search algorithm (CF, JJH), pp. 360–363.
- ICDAR-v1-1995-Gentric #metric #recognition #using
- Experimental results on improved handwritten word recognition using the Levenshtein metric (PG), pp. 364–367.
- ICDAR-v1-1995-GillouxLL #hybrid #markov #network #recognition
- A hybrid radial basis function network/hidden Markov model handwritten word recognition system (MG, BL, ML), pp. 394–397.
- ICDAR-v1-1995-KimG #realtime #recognition
- Handwritten word recognition for real-time applications (GK, VG), pp. 24–27.
- ICDAR-v1-1995-LeeT #clustering #modelling #recognition #semantics
- A language model based on semantically clustered words in a Chinese character recognition system (HJL, CHT), pp. 450–453.
- ICDAR-v1-1995-MahadevanN #metric
- Gap metrics for word separation in handwritten lines (UM, RCN), pp. 124–127.
- ICDAR-v1-1995-OlivierPAL #modelling #probability #recognition #using
- Recognition of handwritten words using stochastic models (CO, TP, MA, YL), pp. 19–23.
- ICDAR-v1-1995-PowalkaSW95a #recognition
- Recognizer characterisation for combining handwriting recognition results at word level (RKP, NS, RJW), pp. 68–73.
- ICDAR-v1-1995-SaonBG #modelling #probability #recognition
- Stochastic trajectory modeling for recognition of unconstrained handwritten words (GS, AB, YG), pp. 508–511.
- ICDAR-v1-1995-ZhaoS #algorithm #image #multi #recognition
- A word recognition algorithm for machine-printed word images of multiple fonts and varying qualities (SXZ, SNS), pp. 351–354.
- ICDAR-v2-1995-CaesarGM95a #recognition #using
- Using lexical knowledge for the recognition of poorly written words (TC, JMG, EM), pp. 915–918.
- ICDAR-v2-1995-Chen95a #recognition
- Lexicon-driven word recognition (CHC), pp. 919–922.
- ICDAR-v2-1995-ChenHP #documentation #image #recursion #segmentation #using
- Simultaneous word segmentation from document images using recursive morphological closing transform (SSC, RMH, ITP), pp. 761–764.
- ICDAR-v2-1995-KimuraMS #algorithm #recognition #using
- Handwritten ZIP code recognition using lexicon free word recognition algorithm (FK, YM, MS), pp. 906–910.
- ICDAR-v2-1995-LuT #segmentation
- Gray scale filtering for line and word segmentation (YL, ACT), pp. 648–651.
- ICDAR-v2-1995-MadhvanathG #classification #recognition
- Serial classifier combination for handwritten word recognition (SM, VG), pp. 911–914.
- ICDAR-v2-1995-NegiSA #approach #segmentation
- A correspondence based approach to segmentation of cursive words (AN, KSS, AA), pp. 1034–1037.
- ICDAR-v2-1995-PriviteraP
- A system for scanning and segmenting cursively handwritten words into basic strokes (CMP, RP), pp. 1047–1050.
- ICDAR-v2-1995-TsuruokaWMKMS #recognition
- Base line correction for handwritten word recognition (ST, NW, NM, FK, YM, MS), pp. 902–905.
- DLT-1995-Berstel
- Recent Results on Sturmian Words (JB), pp. 13–24.
- DLT-1995-Lepisto #complexity #infinity #on the
- On the Computational Complexity of Infinite Words (AL), pp. 350–359.
- DLT-1995-LitovskyS #finite #infinity
- Finite Acceptance of Infinite Words (IL, LS), pp. 360–369.
- ICALP-1995-Lipponen #problem
- Post Correspondence Problem: Words Possible as Primitive Solutions (ML), pp. 63–74.
- ICALP-1995-MetivierRW #set
- Computing the Closure of Sets of Words Under Partial Commutations (YM, GR, PAW), pp. 75–86.
- CHI-1995-ShardanandM #algorithm #automation #information management #social
- Social Information Filtering: Algorithms for Automating “Word of Mouth” (US, PM), pp. 210–217.
- SIGIR-1995-BooksteinKR #clustering #detection
- Detecting Content-Bearing Words by Serial Clustering (AB, STK, TR), pp. 319–327.
- SIGIR-1995-Ornager #analysis #clustering #database #empirical #image
- The Newspaper Image Database: Empirical Supported Analysis of Users’ Typology and Word Association Clusters (SO), pp. 212–218.
- SIGIR-1995-Riloff #classification #difference
- Little Words Can Make a Big Difference for Text Classification (ER), pp. 130–136.
- PDP-1995-Broggi #optimisation #parallel #performance
- Word parallelism vs spatial parallelism: a performance optimization technique on the PAPRICA system (AB), pp. 236–243.
- STOC-1995-Wang #problem
- Average-case completeness of a word problem for groups (JW), pp. 325–334.
- TAPSOFT-1995-WilkeY #infinity #polynomial #regular expression
- Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time (TW, HY), pp. 288–302.
- ICALP-1994-GolinY
- Prefix Codes: Equiprobable Words, Unequal Letter Costs (MJG, NEY), pp. 605–617.
- SIGIR-1994-Sanderson #ambiguity #information retrieval
- Word Sense Disambiguation and Information Retrieval (MS), pp. 142–151.
- SAC-1994-KucherovR #on the #problem #term rewriting
- On ground reducibility problem for word rewriting systems with variables (GK, MR), pp. 271–276.
- ICDAR-1993-Bunke #algorithm #nearest neighbour #performance #taxonomy
- A fast algorithm for finding the nearest neighbor of a word in a dictionary (HB), pp. 632–637.
- ICDAR-1993-ChenD #approach #recognition
- Word recognition in a segmentation-free approach to OCR (CHC, JLD), pp. 573–576.
- ICDAR-1993-GillouxLB #markov #modelling #recognition #using
- Strategies for handwritten words recognition using hidden Markov models (MG, ML, JMB), pp. 299–304.
- ICDAR-1993-HullL #database #documentation #graph #recognition
- Interpreting word recognition decisions with a document database graph (JJH, YL), pp. 488–492.
- ICDAR-1993-KimuraSC #algorithm #recognition
- Improvements of a lexicon directed algorithm for recognition of unconstrained handwritten words (FK, MS, ZC), pp. 18–22.
- ICDAR-1993-PlessisSHMLDM #classification #multi #recognition
- A multi-classifier combination strategy for the recognition of handwritten cursive words (BP, AS, LH, EM, EL, OD, JVM), pp. 642–645.
- ICDAR-1993-PowalkaSEW #interactive #multi #recognition #segmentation
- Multiple word segmentation with interactive look-up for cursive script recognition (RKP, NS, LJE, RJW), pp. 196–199.
- DLT-1993-AtanasiuM
- Substitution on Words and Languages (AA, VM), pp. 51–59.
- CIKM-1993-Sussna #ambiguity #for free #network #semantics #using
- Word Sense Disambiguation for Free-text Indexing Using a Massive Semantic Network (MS), pp. 67–74.
- SIGIR-1993-OgawaBH #keyword #ranking #string
- Simple Word Strings as Compound Keywords: An Indexing and Ranking Method for Japanese Texts (YO, AB, MH), pp. 227–236.
- SIGIR-1993-Voorhees #retrieval #using
- Using WordNet to Disambiguate Word Senses for Text Retrieval (EMV), pp. 171–180.
- ML-1991-HastingsLL #learning
- Learning Words From Context (PMH, SLL, RKL), pp. 55–59.
- CSL-1991-Seibert #quantifier
- Quantifier Hierarchies over Word Relations (SS), pp. 329–352.
- LICS-1991-HuttelS #process #proving #similarity
- Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes (HH, CS), pp. 376–386.
- ICALP-1989-BeauquierP
- Factors of Words (DB, JÉP), pp. 63–79.
- ICALP-1989-EngelfrietH #automaton #infinity
- Automata with Storage on Infinite Words (JE, HJH), pp. 289–303.
- RTA-1989-AbdulrabP #equation #linear
- Solving Systems of Linear Diophantine Equations and Word Equations (HA, JPP), pp. 530–532.
- SIGIR-1989-KrovetzC #ambiguity #using
- Word Sense Disambiguation Using Machine-Readable Dictionaries (RK, WBC), pp. 127–136.
- ASPLOS-1989-CohnGLT #architecture #compilation #trade-off
- Architecture and Compiler Tradeoffs for a Long Instruction Word Microprocessor (RC, TRG, MSL, PST), pp. 2–14.
- CADE-1988-KounalisR #on the #problem
- On Word Problems in Horn Theories (EK, MR), pp. 527–537.
- ICALP-1987-HsiangR #equation #on the #problem
- On Word Problems in Equational Theories (JH, MR), pp. 54–71.
- RTA-1987-SquierO #canonical #finite #monad #problem #term rewriting
- Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems (CCS, FO), pp. 74–82.
- CAAP-1987-Crochemore
- Longest Common Factor of Two Words (MC), pp. 26–36.
- ICALP-1986-GoralcikK #automaton #on the
- On Discerning Words by Automata (PG, VK), pp. 116–122.
- ICALP-1985-BeauquierN #set
- About Rational Sets of Factors of a Bi-Infinite Word (DB, MN), pp. 33–42.
- ICALP-1985-Keranen #morphism #on the
- On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet (VK), pp. 338–347.
- ICALP-1984-BlumerBEHM #automaton #linear #online #set
- Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.
- ICALP-1984-Crochemore #linear
- Linear Searching for a Square in a Word (MC), p. 137.
- SIGIR-1984-JonesB #automation #information retrieval
- The Automatic Extraction of Words from Texts Especially for Input into Information Retrieval Systems Based on Inverted Files (KPJ, CLMB), pp. 409–420.
- CADE-1984-PelinG #algebra #complexity #problem #using
- Solving Word Problems in Free Algebras Using Complexity Functions (AP, JHG), pp. 476–495.
- SLP-1984-WiseP84 #prolog
- Indexing Prolog Clauses via Superimposed Code Words and Filed Encoded Words (MJW, DMWP), pp. 203–210.
- STOC-1973-StockmeyerM #exponential #problem
- Word Problems Requiring Exponential Time: Preliminary Report (LJS, ARM), pp. 1–9.
- LISP-1963-Yates #analysis #compilation #lisp #source code
- LISP. Group Analysis programs. Λ LISP Compiler for a variable word machine (Gamma 30 Scientific) (RY), p. 15.