Hostname: page-component-848d4c4894-jbqgn Total loading time: 0 Render date: 2024-07-03T07:42:18.528Z Has data issue: false hasContentIssue false
  • English
  • Français

Extended finite state models of language

Published online by Cambridge University Press:  01 December 1996

ANDRÁS KORNAI
ANDRÁS KORNAI
Affiliation:
BBN Systems and Technologies, 70 Fawcett St, Cambridge MA 02138, USA. e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In spite of the wide availability of more powerful (context free, mildly context sensitive, and even Turing-equivalent) formalisms, the bulk of the applied work on language and sublanguage modeling, especially for the purposes of recognition and topic search, is still performed by various finite state methods. In fact, the use of such methods in research labs as well as in applied work actually increased in the past five years. To bring together those developing and using extended finite state methods to text analysis, speech/OCR language modeling, and related CL and NLP tasks with those in AI and CS interested in analyzing and possibly extending the domain of finite state algorithms, a workshop was held in August 1996 in Budapest as part of the European Conference on Artificial Intelligence (ECAI'96).

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 4 , December 1996 , pp. 287 - 290
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)