Extended finite state models of language /
Extended finite state models of language /
edited by András Kornai.
- Cambridge, UK ; New York, NY : Cambridge University Press, 1999.
- xii, 278 p. ; 24 cm.
- Studies in natural language processing .
Papers presented at a workshop held Aug. 1996, Budapest, Hungary as part of the European Conference on Artificial Intelligence (ECAI'96).
Includes bibliographical references (p. 255-270) and index.
1. Extended finite state models of language; 2. A parser from antiquity: an early application of finite state transducers to natural language parsing; 3. Comments on Joshi and Hopely; 4. Implementing and using finite automata toolkits; 5. Finite state morphology and formal verification; 6. The Japanese lexical transducer based on stem-suffix style forms; 7. Acquiring rules for reducing morphological ambiguity from POS tagged corpus in Korean; 8. Finite state based reductionist parsing for French; 9. Light parsing as finite state filtering; 10. Vectorized finite state automata; 11. Finite state transducers: parsing free and frozen sentences; 12. Text and speech translation by means of subsequential transducers; 13. Finite state segmentation of discourse into clauses; 14. Between finite state and Prolog: contraint-based automata for efficient recognition of phrases; 15. Explanation-based learning and finite state transducers: applications to parsing lexicalized tree adjoining grammars; 16. Use of weighted finite state transducers; 17. Colonies: a multi-agent approach to language generation; 18. An innovative finite state concept for recognition and parsing of context-free languages; 19. Hidden Markov models with finite state supervision.
052163198X (hb)
98011640
Computational linguistics--Congresses.
P98 / .E965 1999
410.285 KOR
Papers presented at a workshop held Aug. 1996, Budapest, Hungary as part of the European Conference on Artificial Intelligence (ECAI'96).
Includes bibliographical references (p. 255-270) and index.
1. Extended finite state models of language; 2. A parser from antiquity: an early application of finite state transducers to natural language parsing; 3. Comments on Joshi and Hopely; 4. Implementing and using finite automata toolkits; 5. Finite state morphology and formal verification; 6. The Japanese lexical transducer based on stem-suffix style forms; 7. Acquiring rules for reducing morphological ambiguity from POS tagged corpus in Korean; 8. Finite state based reductionist parsing for French; 9. Light parsing as finite state filtering; 10. Vectorized finite state automata; 11. Finite state transducers: parsing free and frozen sentences; 12. Text and speech translation by means of subsequential transducers; 13. Finite state segmentation of discourse into clauses; 14. Between finite state and Prolog: contraint-based automata for efficient recognition of phrases; 15. Explanation-based learning and finite state transducers: applications to parsing lexicalized tree adjoining grammars; 16. Use of weighted finite state transducers; 17. Colonies: a multi-agent approach to language generation; 18. An innovative finite state concept for recognition and parsing of context-free languages; 19. Hidden Markov models with finite state supervision.
052163198X (hb)
98011640
Computational linguistics--Congresses.
P98 / .E965 1999
410.285 KOR