{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:29:39Z","timestamp":1692710979902},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Machine Vis. Apps."],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1007\/bf01219593","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T20:36:38Z","timestamp":1109363798000},"page":"249-259","source":"Crossref","is-referenced-by-count":3,"title":["Integration of lexical and syntactical knowledge in a handwriting-recognition system"],"prefix":"10.1007","volume":"8","author":[{"given":"St\u00e9phanie","family":"Clergeau-Tournemire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9jean","family":"Plamondon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01219593_CR1","series-title":"Parsing, Series in Automatic Computation","volume-title":"The theory of parsing, translation and compiling","author":"A Aho","year":"1972","unstructured":"Aho A, Ullman J (1972) The theory of parsing, translation and compiling. Parsing, Series in Automatic Computation, Prentice-Hall, Englewood Cliffs, N.J., vol. 1"},{"key":"BF01219593_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TPAMI.1983.4767370","volume":"5","author":"LR Bahl","year":"1983","unstructured":"Bahl LR, Jelinek F, Mercer RL (1983) A maximum likelihood approach to continuous speech recognition. IEEE Trans Patt Anal Machine Intell 5:179\u201390","journal-title":"IEEE Trans Patt Anal Machine Intell"},{"key":"BF01219593_CR3","first-page":"521","volume-title":"Speech Recognition","author":"JK Baker","year":"1975","unstructured":"Baker JK (1975) Stochastic modeling for automatic speech understanding. In Reddy DR (ed.) Speech Recognition, Academic Press New York, pp 521\u2013542"},{"key":"BF01219593_CR4","unstructured":"Barri\u00e8re C (1991) Exploration de l'approche par r\u00e9seaux neuronnaux pour la reconnaissance de symboles manuscrits. M.Sc.A. Thesis, Montreal School of Polytechnics"},{"key":"BF01219593_CR5","unstructured":"Barri\u00e9re C, Plamondon R (1992a) Recognizing sequences of letters in mixed-script handwriting. Proceedings Vision Interface, pp 83\u201391"},{"key":"BF01219593_CR6","unstructured":"Barri\u00e9re C, Plamondon R (1992b) R\u00e9seaux neuronaux et mesure de similarit\u00e9 pour la reconnaissance d'\u00e9criture cursive. Bigre n.80-CNED'92: Conference on Handwriting and Documents, Nancy, France, pp 178\u2013186"},{"key":"BF01219593_CR7","doi-asserted-by":"crossref","DOI":"10.1515\/9783112316009","volume-title":"Syntactic structures","author":"N Chomsky","year":"1957","unstructured":"Chomsky N (1957) Syntactic structures. Mouton, The Hague"},{"key":"BF01219593_CR8","unstructured":"Catach N (1984) Les listes orthographiques de base du fran\u00c7ais (LOB): les mots les plus fr\u00e9quents et leurs formes fl\u00e9chies les plus fr\u00e9quentes. Nathan F (ed.) Paris"},{"key":"BF01219593_CR9","doi-asserted-by":"crossref","unstructured":"Church KW (1989) Stochastic parts program and noun phrase parser for unrestricted text. Internation Conference on Acoustics, Speech and Signal Processing '89, pp 695\u2013698","DOI":"10.1109\/ICASSP.1989.266522"},{"key":"BF01219593_CR10","unstructured":"Clergeau S (1993) Int\u00e9gration de connaissances lexicales et syntaxiques \u00e0 un syst\u00e8me de reconnaissance d'\u00e9criture manuscrite. M.Sc. A. Thesis, Montreal School of Polytechnics"},{"key":"BF01219593_CR11","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1109\/34.93811","volume":"13","author":"A Corraza","year":"1991","unstructured":"Corraza A, De Mori R, Gretter G, Satta G (1991) Computation of probabilities for an island-driven parser. IEEE Trans Patt Anal Machine Intell 13:936\u2013950","journal-title":"IEEE Trans Patt Anal Machine Intell"},{"key":"BF01219593_CR12","first-page":"742","volume":"8","author":"AM Derouault","year":"1984","unstructured":"Derouault AM, Merialdo B (1984) Natural language modelling for phoneme-to-text transcription. IEEE Trans Patt Anal Machine Intell 8:742\u2013749","journal-title":"IEEE Trans Patt Anal Machine Intell"},{"key":"BF01219593_CR13","doi-asserted-by":"crossref","unstructured":"Dumouchel P, Gupta V, Lennig L, Mermelstein P (1988) Three probabilistic language models for a large-vocabulary speech recognizer. International Conference on Acoustics, Speech and Signal Processing '88, pp 513\u2013516","DOI":"10.1109\/ICASSP.1988.196632"},{"key":"BF01219593_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1142\/9789814439329_0014","volume-title":"Computer Processing of Handwriting","author":"DM Ford","year":"1990","unstructured":"Ford DM, Higgins CA (1990) A tree-based dictionary search technique and comparison with n-gram letter graph reduction. In: Plamondon R, Leedham G (eds.) Computer Processing of Handwriting pp 291\u2013312, World Scientific Pub., Singapore"},{"key":"BF01219593_CR15","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0031-3203(88)90005-2","volume":"21","author":"A Goshtasby","year":"1988","unstructured":"Goshtasby A, Ehrich RW (1988) Contextual word recognition using probabilistic relaxation labelling. Patt Recogn 21:455\u2013462","journal-title":"Patt Recogn"},{"key":"BF01219593_CR16","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/TPAMI.1982.4767297","volume":"4","author":"JJ Hull","year":"1982","unstructured":"Hull JJ, Srihari SN (1982) Experiments in text recognition with binary n-grams and viterbi algorithms. IEEE Trans Patt Anal Machine Intell, 4:520\u2013530","journal-title":"IEEE Trans Patt Anal Machine Intell"},{"key":"BF01219593_CR17","doi-asserted-by":"crossref","unstructured":"Jelinek F (1991) Up from trigrams! The struggle for improved language models. Eurospeech 1991, Continuous Speech Recognition Group","DOI":"10.21437\/Eurospeech.1991-248"},{"key":"BF01219593_CR18","volume-title":"Internal Report","author":"F Jelinek","year":"1990","unstructured":"Jelinek F and Lafferty JD (1990) Computation of the probability of initial substring generation by stochastic context-free grammars. Internal Report, Continuous Speech Recognition Group, IBM Research, T.J. Watson Research Center, Yorktown Heights, NY"},{"key":"BF01219593_CR19","volume-title":"Basic method of probabilistic context-free grammars. Internal Report","author":"F Jelinek","year":"1991","unstructured":"Jelinek F, Lafferty JD, Mercer RL (1991) Basic method of probabilistic context-free grammars. Internal Report, T.J. Watson Research Center, Yorktown Heights, NY"},{"key":"BF01219593_CR20","unstructured":"Jones A, Story A, Ballard W (1991) Integrating multiple knowledge sources in a bayesian OCR postprocessor. International Conference on Document Analysis and Recognition, St-Malo, France pp 925\u2013933"},{"key":"BF01219593_CR21","unstructured":"Keenan FG, Evett LJ, Whitrow RJ (1991) A large vocabulary stochastic syntax analyzer for handwriting recognition. International Conference on Document Analysis and Recognition, St-Malo, France, pp 794\u2013802"},{"key":"BF01219593_CR22","unstructured":"Lowerre B (1980) The HARPY speech understanding system. In: Les WA (ed.) Trends in speech recognition, Prentice-Hall"},{"key":"BF01219593_CR23","doi-asserted-by":"crossref","unstructured":"Mergel D, Peaseler A (1987) Construction of language models for spoken database queries. Proceedings of the International Conference on Acoustics, Speech and Signal Processing, Dallas, pp 844\u2013847","DOI":"10.1109\/ICASSP.1987.1169846"},{"key":"BF01219593_CR24","doi-asserted-by":"crossref","unstructured":"Parisse C, Rosenthal V, Imadache A, Andreewsky E, Cochu F (1990) A task oriented approach to reading and to handwritten text recognition. In: Plamondon R & Leedham CG (eds) Computer Processing of Handwriting. World Scientific Publishing, pp 313\u2013335","DOI":"10.1142\/9789814439329_0015"},{"key":"BF01219593_CR25","doi-asserted-by":"crossref","unstructured":"Plamondon R, Clergeau-Tournemire S., Barri\u00e8re C (1994) Handwritten sentence recognition: From signal to syntax. Proceedings of the 12th International Conference on Pattern Recognition, Jerusalem, pp 117\u2013122","DOI":"10.1109\/ICPR.1994.576887"},{"key":"BF01219593_CR26","unstructured":"Pr\u00e9fontaine R, R\u00e9pertoire du vocabulaire oral des 6-12 ans: \u00e9valuation de l'\u00e9tendue du vocabulaire oral et \u00e9crit. Le Sablier, Boucherville, Canada"},{"key":"BF01219593_CR27","unstructured":"Proximity Technology (1987) PF474 Developer Toolkit"},{"key":"BF01219593_CR28","unstructured":"Quinton P (1977) Utilisation d'un analyseur syntatxique pour la reconnaissanece de la parole continue. Annales des T\u00e9l\u00e9communications, vol. 32"},{"key":"BF01219593_CR29","unstructured":"Sabah G (1988) Traitement des non-attendus. L'intelligence artificielle et le langage, pp 152\u2013184"},{"key":"BF01219593_CR30","doi-asserted-by":"crossref","unstructured":"Seneff S (1989) TINA: a probabilistic syntactic parser for speech understanding systems. International Conference on Acoustics, Speech and Signal Processing '89, pp 711\u2013714","DOI":"10.1109\/ICASSP.1989.266526"},{"key":"BF01219593_CR31","unstructured":"Ters F (1986) Les 1000 mots fondamentaux de l'\u00e9cole \u00e9l\u00e9mentaire: \u00e9chelle Dubois-Buyse, vocabulaire actif. In: Orgeval, MDI (ed)"},{"key":"BF01219593_CR32","unstructured":"Ullmann JR (1975) A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words. Comp J, vol. 20"},{"key":"BF01219593_CR33","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","volume":"13","author":"AJ Viterbi","year":"1967","unstructured":"Viterbi AJ (1967) Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Trans Inform Theory 13:260\u2013269","journal-title":"IEEE Trans Inform Theory"},{"key":"BF01219593_CR34","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner RA, Fischer MJ (1974) The string to string correction problem. J ACM 21:168\u2013173","journal-title":"J ACM"},{"key":"BF01219593_CR35","unstructured":"Wells CJ, Evett LJ, Whitby PE, Whitrow RJ (1991) Word look-up for script recognition \u2014 choosing a candidate. International Conference on Document Analysis and Recognition, St-Malo, France, pp 620\u2013628"}],"container-title":["Machine Vision and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01219593.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01219593\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01219593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T11:17:22Z","timestamp":1683026242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01219593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01219593"],"URL":"https:\/\/doi.org\/10.1007\/bf01219593","relation":{},"ISSN":["0932-8092","1432-1769"],"issn-type":[{"value":"0932-8092","type":"print"},{"value":"1432-1769","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}