메뉴 건너뛰기




Volumn , Issue , 2016, Pages 623-633

Weighting finite-state transductions with neural context

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DYNAMIC PROGRAMMING; PROBABILITY DISTRIBUTIONS; TRANSDUCERS;

EID: 84994070679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.18653/v1/n16-1076     Document Type: Conference Paper
Times cited : (88)

References (42)
  • 3
    • 85083953689 scopus 로고    scopus 로고
    • Neural machine translation by jointly learning to align and translate
    • Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2015. Neural machine translation by jointly learning to align and translate. In Proceedings of ICLR.
    • (2015) Proceedings of ICLR.
    • Bahdanau, D.1    Cho, K.2    Bengio, Y.3
  • 4
    • 41049105254 scopus 로고    scopus 로고
    • Joint-sequence models for grapheme-to-phoneme conversion
    • Maximilian Bisani and Hermann Ney. 2008. Joint-sequence models for grapheme-to-phoneme conversion. Speech Communication, 50(5):434-451.
    • (2008) Speech Communication , vol.50 , Issue.5 , pp. 434-451
    • Bisani, M.1    Ney, H.2
  • 5
    • 0001699291 scopus 로고
    • Training stochastic model recognition algorithms as networks can lead to maximum mutual information estimation of parameters
    • John S. Bridle. 1990. Training stochastic model recognition algorithms as networks can lead to maximum mutual information estimation of parameters. In Proceedings of NIPS, pages 211-217.
    • (1990) Proceedings of NIPS , pp. 211-217
    • Bridle, J.S.1
  • 6
    • 0032649022 scopus 로고    scopus 로고
    • Optimal linguistic decoding is a difficult computational problem
    • Francisco Casacuberta and Colin de la Higuera. 1999. Optimal linguistic decoding is a difficult computational problem. Pattern Recognition Letters, 20(8):813-821.
    • (1999) Pattern Recognition Letters , vol.20 , Issue.8 , pp. 813-821
    • Casacuberta, F.1    De La Higuera, C.2
  • 8
    • 85009227369 scopus 로고    scopus 로고
    • Conditional and joint models for grapheme-to-phoneme conversion
    • Stanley F. Chen. 2003. Conditional and joint models for grapheme-to-phoneme conversion. In Proceedings of EUROSPEECH.
    • (2003) Proceedings of EUROSPEECH
    • Chen, S.F.1
  • 9
    • 85127836544 scopus 로고    scopus 로고
    • Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms
    • Philadelphia, July
    • Michael Collins. 2002. Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, Philadelphia, July.
    • (2002) Proceedings of the Conference on Empirical Methods in Natural Language Processing
    • Collins, M.1
  • 10
    • 84906923502 scopus 로고    scopus 로고
    • Stochastic contextual edit distance and probabilistic FSTs
    • June
    • Ryan Cotterell, Nanyun Peng, and Jason Eisner. 2014. Stochastic contextual edit distance and probabilistic FSTs. In Proceedings of ACL, pages 625-630, June.
    • (2014) Proceedings of ACL , pp. 625-630
    • Cotterell, R.1    Peng, N.2    Eisner, J.3
  • 11
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1).
    • (1959) Numerische Mathematik , vol.1 , Issue.1
    • Dijkstra, E.W.1
  • 13
    • 70450158501 scopus 로고    scopus 로고
    • Latent-variable modeling of string transductions with finite-state methods
    • October
    • Markus Dreyer, Jason R. Smith, and Jason Eisner. 2008. Latent-variable modeling of string transductions with finite-state methods. In Proceedings of EMNLP, pages 1080-1089, October.
    • (2008) Proceedings of EMNLP , pp. 1080-1089
    • Dreyer, M.1    Smith, J.R.2    Eisner, J.3
  • 16
    • 84943742882 scopus 로고    scopus 로고
    • Transition-based dependency parsing with stack long short-term memory
    • July
    • Chris Dyer, Miguel Ballesteros, Wang Ling, Austin Matthews, and Noah A. Smith. 2015. Transition-based dependency parsing with stack long short-term memory. In Proceedings of ACL-IJCNLP, pages 334-343, July.
    • (2015) Proceedings of ACL-IJCNLP , pp. 334-343
    • Dyer, C.1    Ballesteros, M.2    Ling, W.3    Matthews, A.4    Smith, N.A.5
  • 17
    • 85149140805 scopus 로고    scopus 로고
    • Parameter estimation for probabilistic finite-state transducers
    • July
    • Jason Eisner. 2002. Parameter estimation for probabilistic finite-state transducers. In Proceedings of ACL, pages 1-8, July.
    • (2002) Proceedings of ACL , pp. 1-8
    • Eisner, J.1
  • 18
    • 84994149005 scopus 로고    scopus 로고
    • Morphological inflection generation using character sequence to sequence learning
    • Code
    • Manaal Faruqui, Yulia Tsvetkov, Graham Neubig, and Chris Dyer. 2016. Morphological inflection generation using character sequence to sequence learning. In Proceedings of NAACL. Code available at https://github.com/mfaruqui/morph-trans.
    • (2016) Proceedings of NAACL
    • Faruqui, M.1    Tsvetkov, Y.2    Neubig, G.3    Dyer, C.4
  • 19
    • 72449211489 scopus 로고    scopus 로고
    • Efficient, feature-based, conditional random field parsing
    • Jenny Rose Finkel, Alex Kleeman, and Christopher D. Manning. 2008. Efficient, feature-based, conditional random field parsing. In Proceedings of ACL, pages 959-967.
    • (2008) Proceedings of ACL , pp. 959-967
    • Finkel, J.R.1    Kleeman, A.2    Manning, C.D.3
  • 21
    • 84878574799 scopus 로고    scopus 로고
    • Deep-hidden conditional neural fields for continuous phoneme speech recognition
    • Yasuhisa Fujii, Kazumasa Yamamoto, and Seiichi Nakagawa. 2012. Deep-hidden conditional neural fields for continuous phoneme speech recognition. In Proceedings of IWSML.
    • (2012) Proceedings of IWSML
    • Fujii, Y.1    Yamamoto, K.2    Nakagawa, S.3
  • 22
    • 84858385957 scopus 로고    scopus 로고
    • Softmax-margin CRFs: Training log-linear models with cost functions
    • June
    • Kevin Gimpel and Noah A. Smith. 2010. Softmax-margin CRFs: Training log-linear models with cost functions. In Proceedings of NAACL-HLT, pages 733-736, June.
    • (2010) Proceedings of NAACL-HLT , pp. 733-736
    • Gimpel, K.1    Smith, N.A.2
  • 23
    • 27744588611 scopus 로고    scopus 로고
    • Framewise phoneme classification with bidirectional lstm and other neural network architectures
    • Alex Graves and Jürgen Schmidhuber. 2005. Framewise phoneme classification with bidirectional lstm and other neural network architectures. Neural Networks, 18(5):602-610.
    • (2005) Neural Networks , vol.18 , Issue.5 , pp. 602-610
    • Graves, A.1    Schmidhuber, J.2
  • 28
    • 52149101362 scopus 로고    scopus 로고
    • Applying many-to-many alignments and hidden Markov models to letter-to-phoneme conversion
    • Sittichai Jiampojamarn, Grzegorz Kondrak, and Tarek Sherif. 2007. Applying many-to-many alignments and hidden Markov models to letter-to-phoneme conversion. In Proceedings of NAACL-HLT, pages 372-379.
    • (2007) Proceedings of NAACL-HLT , pp. 372-379
    • Jiampojamarn, S.1    Kondrak, G.2    Sherif, T.3
  • 31
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • Vladimir I. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8):707-710.
    • (1966) Soviet Physics Doklady , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, V.I.1
  • 32
    • 80053275857 scopus 로고    scopus 로고
    • First- and second-order expectation semirings with applications to minimum-risk training on translation forests
    • August
    • Zhifei Li and Jason Eisner. 2009. First- and second-order expectation semirings with applications to minimum-risk training on translation forests. In Proceedings of EMNLP, pages 40-51, August.
    • (2009) Proceedings of EMNLP , pp. 40-51
    • Li, Z.1    Eisner, J.2
  • 33
    • 85186084456 scopus 로고    scopus 로고
    • Variational decoding for statistical machine translation
    • Zhifei Li, Jason Eisner, and Sanjeev Khudanpur. 2009. Variational decoding for statistical machine translation. In Proceedings of ACL, pages 593-601.
    • (2009) Proceedings of ACL , pp. 593-601
    • Li, Z.1    Eisner, J.2    Khudanpur, S.3
  • 34
    • 56449097408 scopus 로고    scopus 로고
    • A better n-best list: Practical determinization of weighted finite tree automata
    • Jonathan May and Kevin Knight. 2006. A better n-best list: Practical determinization of weighted finite tree automata. In Proceedings of NAACL, pages 351-358.
    • (2006) Proceedings of NAACL , pp. 351-358
    • May, J.1    Knight, K.2
  • 35
    • 34547970628 scopus 로고    scopus 로고
    • Three new graphical models for statistical language modelling
    • ACM
    • Andriy Mnih and Geoffrey Hinton. 2007. Three new graphical models for statistical language modelling. In Proceedings of ICML, pages 641-648. ACM.
    • (2007) Proceedings of ICML , pp. 641-648
    • Mnih, A.1    Hinton, G.2
  • 36
    • 0348198473 scopus 로고    scopus 로고
    • Finite-state transducers in language and speech processing
    • Mehryar Mohri. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269-311.
    • (1997) Computational Linguistics , vol.23 , Issue.2 , pp. 269-311
    • Mohri, M.1
  • 37
    • 84863373241 scopus 로고    scopus 로고
    • Conditional neural fields
    • Jian Peng, Liefeng Bo, and Jinbo Xu. 2009. Conditional neural fields. In Proceedings of NIPS, pages 1419-1427.
    • (2009) Proceedings of NIPS , pp. 1419-1427
    • Peng, J.1    Bo, L.2    Xu, J.3
  • 38
    • 4244074850 scopus 로고    scopus 로고
    • Technical Report Princeton University, Department of Computer Science, October. Revised October 1997
    • Eric Sven Ristad and Peter N. Yianilos. 1996. Learning string edit distance. Technical Report CS-TR-532-96, Princeton University, Department of Computer Science, October. Revised October 1997.
    • (1996) Learning String Edit Distance
    • Ristad, E.S.1    Yianilos, P.N.2
  • 40
    • 82355186407 scopus 로고    scopus 로고
    • Joint optimization of hidden conditional random fields and non-linear feature extraction
    • IEEE
    • Antoine Vinel, Trinh Minh Tri Do, and Thierry Artieres. 2011. Joint optimization of hidden conditional random fields and non-linear feature extraction. In Proceedings of ICDAR, pages 513-517. IEEE.
    • (2011) Proceedings of ICDAR , pp. 513-517
    • Vinel, A.1    Do, T.M.T.2    Artieres, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.