Tomasz Kowaltowski, Cláudio L. Lucchesi, Jorge Stolfi  Home/Search
Context
Related
| dcc.unicamp.br/ictrftp/...9802.ps.gz dcc.unicamp.br/~stolfi/EX...9802.ps.gz dcc.unicamp.br/~st...to98lexitr.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcc.unicamp.br/ictr...Abstracts (more) From: dcc.unicamp.br/~stolfi/E...stolfi (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a general technique for the encoding of lexical functions --- such as lexical classification, gender and number marking, inflections and conjugations --- using minimized acyclic finite-state automata. This technique has been used to store a Portuguese lexicon with over 2 million entries in about 1 megabyte. Unlike general file compression schemes, this representation allows random access to the stored data. Moreover it allows the lexical functions and their inverses to be computed... (Update)
Active bibliography (related documents): More All
0.5: Minimization of Binary Automata - Kowaltowski, Lucchesi, Stolfi (1993) (Correct)
0.3: Using default inheritance to describe LTAG - Evans, Gazdar, Weir (1994) (Correct)
0.3: Selva: A New Syntactic Parser for Portuguese - Sheila De Almeida (Correct)
Similar documents based on text: More All
0.6: Applications of Finite Automata Representing Large Vocabularies - Lucchesi, al. (1992) (Correct)
0.6: Application of Finite Automata in Debugging Natural.. - Kowaltowski.. (1993) (Correct)
0.4: Examples of Informal but Rigorous Correctness Proofs for Tree.. - Kowaltowski (1992) (Correct)
BibTeX entry: (Update)
@misc{ kowaltowski-finite,
author = "Tomasz Kowaltowski and Cláudio L. Lucchesi and Jorge Stolfi",
title = "Finite Automata and Efficient Lexicon Implementation",
url = "citeseer.ist.psu.edu/kowaltowski88finite.html" }
Citations (may not include all citations):127 System Programming with Modula (context) - Nelson - 1991
51 Prentice Hall (context) - Harbison - 1992
37 Two-level morphology with composition - Karttunen, Kaplan et al. - 1992
30 DATR: A language for lexical knowledge representation - Evans, Gazdar - 1996
25 The world's fastest Scrabble program (context) - Appel, Jacobson - 1988
23 Constructing lexical transducers - Karttunen - 1994
22 Communications of the ACM (context) - Bentley, checker - 1985
15 A finite-state morphological processor for Spanish - Tzoukermann, Liberman - 1990
13 Applications of finite automata representing large vocabular.. - Lucchesi, Kowaltowski - 1993
3 Linguistic issues in the development of ReGra: A grammar che.. (context) - Martins, Hasegawa et al.
3 A reusable lexical database tool for machine translation (context) - Blaser, Schwall et al. - 1992
3 Application of finite automata in debugging natural language.. - Kowaltowski, Lucchesi et al. - 1995
3 Reverse queries in DATR - Langer - 1994
1 Minimization of binary finite automata (context) - Kowaltowski, Lucchesi et al. - 1995
1 volume 898 of Lecture Notes in Artificial Intelligence (context) - Carbonell, Siekmann et al. - 1995
1 An integrated environment for lexical analyses (context) - Caligaris, Cappelli et al. - 1992
1 DZ: A text compression algorithm for natural languages (context) - Revuz, Zipstein - 1992
1 EBL 2 : An approach to automatic lexical acqusition (context) - Asker, Gamback et al. - 1992
Documents on the same site (http://www.dcc.unicamp.br/ic-tr-ftp/ALL/Abstracts.html): More
The Implementation of Guaraná on Java - Oliva, Buzato (1998) (Correct)
Minimization of Binary Automata - Kowaltowski, Lucchesi, Stolfi (1993) (Correct)
Exact Solutions of Rectangular Partitions via Integer.. - de Meneses, de Souza (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC