D09-1023 Parsing We decode by performing lattice parsing on a lattice encoding the set
D14-1098 Decoding by Translation Using either lattice parsing or partial parsing , a two-pass
D11-1044 word is assigned a parent . In lattice parsing , however , most lattice edges
C90-2011 structure with efficient word lattice parsing scheme in speech recognition
D09-1023 grammar Gs , r8 . We solve this by lattice parsing , assuming that an upper bound
D11-1044 , we compare our QPDG system ( lattice parsing on each lattice ) to the Moses
C90-2011 Structure with Efficient Word Lattice Parsing Scheme In Speech Recognition
D14-1098 implement and compare two approaches lattice parsing enables a sequential coupling
D09-1023 Given the lattice and Gs , r8 , lattice parsing is a straightforward generalization
C90-2011 been augmented for efficient word lattice parsing to handle the high degree of
D09-1023 based on efficient DP-based QG lattice parsing extended to handle " non-local
D09-1023 τs ) , we perform " inside " lattice parsing with Gs , Ts . The technique
C90-3042 tables and how to use them in word lattice parsing . Section 4 discusses the robustness
C88-2118 that it can be used for a word lattice parsing fromita 1986 / . Our algorithm
D09-1023 Translation by Quasi-Synchronous Lattice Parsing Gimpel A. Language Technologies
D08-1025 applicable to string parsing and lattice parsing -- notably the computation of
D14-1098 probability Pl ( ˜vl | wl ) . The lattice parsing operation consists of the an
D14-1098 permissible under the con - straint . Lattice parsing enables a sequential coupling
D11-1044 the lattice and Gs , τ8 , lattice parsing is a straightforward generalization
D14-1098 this paper , we propose using lattice parsing and partial parsing to incorporate
hide detail