A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata

No abstract is available for this paper.

• Publication year

  2006

• Venue

  North American Chapter of the Association for Computational Linguistics

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Submission to ICGI-2000 Computational complexity of problems on probabilistic grammars and transducers

  2007cited by this paper
• Tree Automata

  2005cited by this paper
• Better k-best Parsing

  2005influential reference
• Interactively Exploring a Machine Translation Model

  2005cited by this paper
• Incremental Parsing with the Perceptron Algorithm

  2004cited by this paper
• What’s in a translation rule?

  2004cited by this paper
• An efficient implementation of a new DOP model

  2003cited by this paper
• Determinization of Finite State Weighted Tree Automata

  2003cited by this paper
• An efficient algorithm for the n-best-strings problem

  2002cited by this paper
• The Practical Value of N-Grams Is in Generation

  1998cited by this paper
• Finite-State Transducers in Language and Speech Processing

  1997influential reference
• Tree automata techniques and applications

  1997cited by this paper
• Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars

  1996cited by this paper
• A Computational Model of Language Performance: Data Oriented Parsing

  1992cited by this paper
• Mathematical and computational aspects of lexicalized grammars

  1990cited by this paper
• Tree Acceptors and Some of Their Applications

  1970cited by this paper
• Tree Generating Regular Systems

  1969cited by this paper
• Generalized finite automata theory with an application to a decision problem of second-order logic

  1968cited by this paper
• Decidability of second-order theories and automata on infinite trees

  1968cited by this paper
• A note on two problems in connexion with graphs

  1959cited by this paper

• Preference Grammars and Decoding Algorithms for Probabilistic Synchronous Context Free Grammar Based Translation

  2024cites this paper
• Computational Morphology with Neural Network Approaches

  2021cites this paper
• Constraining Linear-chain CRFs to Regular Languages

  2021cites this paper
• Sequentiality of Group-Weighted Tree Automata

  2021cites this paper
• Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs

  2019cites this paper
• A Simple Joint Model for Improved Contextual Neural Lemmatization

  2019cites this paper
• Bimorphism Machine Translation

  2016cites this paper
• Weighting Finite-State Transductions With Neural Context

  2016cites this paper
• The correctness of a generalized disambiguation algorithm for finite automata 林克彦

  2014cites this paper
• Hyper-Minimization for Deterministic Weighted Tree Automata

  2014cites this paper
• EXACT SAMPLING AND OPTIMISATION IN STATISTICAL MACHINE TRANSLATION

  2014cites this paper
• A generalized disambiguation algorithm for weighted finite automata and its application to NLP tasks 林克彦

  2014cites this paper
• Algebraic decoder specification: coupling formal-language theory and statistical machine translation

  2014influential citation
• A Convexity-based Generalization of Viterbi for Non-Deterministic Weighted Automata

  2013cites this paper
• Computing the Most Probable String with a Probabilistic Finite State Machine

  2013cites this paper
• Towards Probabilistic Acceptors and Transducers for Feature Structures

  2012influential citation
• Improving NLP through Marginalization of Hidden Syntactic Structure

  2012cites this paper
• Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields

  2012cites this paper
• Preservation of Recognizability for Weighted Linear Extended Top-down Tree Transducers Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields Ttt: a Tree Transduction Language for Syntactic and Semantic Processing Second Position Clitics and Monadic Second-order Transduction

  2012cites this paper
• Discriminative Feature-Rich Modeling for Syntax-Based Machine Translation

  2012cites this paper
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring

  2012cites this paper
• DAGGER: A Toolkit for Automata on Directed Acyclic Graphs

  2012cites this paper
• Minimum Imputed-Risk: Unsupervised Discriminative Training for Machine Translation

  2011cites this paper
• Probabilistic inference for phrase-based machine translation : a sampling approach

  2011cites this paper
• Millstream Systems – a Formal Model for Linking Language Modules by Interfaces N-best Parsing Revisited Workshop Program Preservation of Recognizability for Synchronous Tree Substitution Grammars Requirements on a Tree Transformation Model for Machine Translation Preservation of Recognizability for

  2010cites this paper
• Formalizing the Use and Characteristics of Constraints in Pipeline Systems

  2010cites this paper
• n-Best Parsing Revisited

  2010cites this paper
• Determinization of Weighted Tree Automata Using Factorizations

  2010cites this paper
• Weighted Monadic Datalog Tree Transducers ∗

  2010cites this paper
• Weighted tree automata and transducers for syntactic natural language processing

  2010cites this paper
• Discriminative training and variational decoding in machine translation via novel algorithms for weighted hypergraphs

  2010cites this paper
• Preference Grammars: Softening Syntactic Constraints to Improve Statistical Machine Translation

  2009cites this paper
• Monte Carlo inference and maximization for phrase-based translation

  2009cites this paper
• Minimizing deterministic weighted tree automata

  2009cites this paper
• Applications of Weighted Automata in Natural Language Processing

  2009cites this paper
• Variational Decoding for Statistical Machine Translation

  2009cites this paper
• Actor Positioning in Wireless Sensor and Actor Networks Using Matching Theory

  2009cites this paper
• Regular Tree Grammars as a Formalism for Scope Underspecification

  2008cites this paper
• On improving natural language processing through phrase-based and one-to-one syntactic algorithms

  2008cites this paper
• A Weighted Tree Transducer Toolkit for Syntactic Natural Language Processing Models

  2008cites this paper
• Forest-based algorithms in natural language processing

  2008cites this paper
• Novel estimation methods for unsupervised discovery of latent structure in natural language text

  2007cites this paper
• Bisimulation Minimisation for Weighted Tree Automata

  2007cites this paper
• The N-Best Decoding Algorithm for TAT-based Translation Model

  2007cites this paper
• Statistical Syntax-Directed Translation with Extended Domain of Locality

  2006cites this paper
• A Syntax-Directed Translator with Extended Domain of Locality

  2006cites this paper
• Tiburon: A Weighted Tree Automata Toolkit

  2006cites this paper