NLP Applications Based on Weighted Multi-Tape Automata
نویسنده
چکیده
This article describes two practical applications of weighted multi-tape automata (WMTAs) in Natural Language Processing, that demonstrate the augmented descriptive power of WMTAs compared to weighted 1-tape and 2-tape automata. The two examples concern the preservation of intermediate results in transduction cascades and the search for similar words in two languages. As a basis for these applications, the article proposes a number of operations on WMTAs. Among others, it (re-)defines multi-tape intersection, where a number of tapes of one WMTA are intersected with the same number of tapes of another WMTA. In the proposed approach, multi-tape intersection is not an atomic operation but rather a sequence of more elementary ones, which facilitates its implementation.
منابع مشابه
Tiburon: A Weighted Tree Automata Toolkit
The availability of weighted finite-state string automata toolkits made possible great advances in natural language processing. However, recent advances in syntax-based NLP model design are unsuitable for these toolkits. To combat this problem, we introduce a weighted finite-state tree automata toolkit, which incorporates recent developments in weighted tree automata theory and is useful for na...
متن کاملar X iv : c s . C L / 0 40 60 03 v 1 2 J un 2 00 4 Algorithms for Weighted Multi - Tape Automata – XRCE Research Report 2004 / 031 – Andre Kempe
This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA, which can be seen as a generalization of transducer intersection. In our approach, multi-tape intersection is not co...
متن کاملAlgorithms for weighted multi-tape automata
This report defines various operations and describes algorithms for weighted multi-tape automata (WMTAs). It presents, among others, a new approach to multi-tape intersection, meaning the intersection of a number of tapes of one WMTA with the same number of tapes of another WMTA, which can be seen as a generalization of transducer intersection. In our approach, multi-tape intersection is not co...
متن کاملAsynchronous Multi-Tape Automata Intersection: Undecidability and Approximation
When their reading heads are allowed to move completely asynchronously, finite-state automata with multiple tapes achieve a significant expressive power, but also lose useful closure properties—closure under intersection, in particular. This paper investigates to what extent it is still feasible to use multi-tape automata as recognizers of polyadic predicates on words. On the negative side, det...
متن کاملRevisiting Multi-Tape Automata for Semitic Morphological Analysis and Generation
Various methods have been devised to produce morphological analyzers and generators for Semitic languages, ranging from methods based on widely used finitestate technologies to very specific solutions designed for a specific language or problem. Since the earliest proposals of how to adopt the elsewhere successful finite-state methods to root-andpattern morphologies, the solution of encoding Se...
متن کامل