Filters








77,443 Hits in 4.0 sec

On inferring linear single-tree languages

Erkki Mäkinen
2000 Information Processing Letters  
We consider the inferability of linear single-tree languages.  ...  We are able to show that if the terminal productions of the corresponding grammars obey a simple restriction, then the languages generated are inferable from positive samples only.  ...  In this paper we consider linear STG's and the languages generated by these grammars, i.e. linear single tree languages LSTL's.  ... 
doi:10.1016/s0020-0190(99)00157-x fatcat:w6fhz3pyqfgmlcehgcjqxebnmy

Page 6650 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
This implies that to infer parenthesis linear grammars, we can use any inference algorithm for regular sets.  ...  parenthesis linear grammars based on control sets.  ... 

Structured Prediction Models via the Matrix-Tree Theorem

Terry Koo, Amir Globerson, Xavier Carreras, Michael Collins
2007 Conference on Empirical Methods in Natural Language Processing  
To demonstrate an application of the method, we perform experiments which use the algorithm in training both log-linear and max-margin dependency parsers.  ...  We show how partition functions and marginals for directed spanning trees can be computed by an adaptation of Kirchhoff's Matrix-Tree Theorem.  ...  Out of 2,472 sentences total, log-linear models gave improved parses over the perceptron on 448 sentences, and worse parses on 343 sentences.  ... 
dblp:conf/emnlp/KooGCC07 fatcat:5jadmvjttrdzzdss3kpiznkx7i

Page 7339 of Mathematical Reviews Vol. , Issue 2000j [page]

2000 Mathematical Reviews  
Summary: “We consider the inferability of linear single-tree lan- guages.  ...  Sanjay Jain (Singapore) 2000j:68085 68Q32 Makinen, Erkki (FIN-TAM-C; Tampere) On inferring linear single-tree languages. (English summary) Inform. Process. Lett. 73 (2000), no. 1-2, 1-3.  ... 

Computing the Cost of Typechecking of Composition of Macro Tree Transducers

Keisuke Nakano, Sebastian Maneth
2009 IPSJ Online Transactions  
Typechecking macro tree transducers is generally based on inverse type inference, because of the advantageous property that inverse transformations effectively preserve regular tree languages.  ...  Typechecking a tree transformation means checking whether all valid input trees are transformed into valid output trees, for the given regular tree languages of input and output trees.  ...  Baker presented more results on the composition of tdtts that were obtained by combining results where the composition of linear tree transducers was linear or where the composition of one state tree transducers  ... 
doi:10.2197/ipsjtrans.2.175 fatcat:jyotdksf4fddzaxeht6nmjlmw4

Page 6545 of Mathematical Reviews Vol. , Issue 87k [page]

1987 Mathematical Reviews  
Then we propose a linear ordering among these sequences, i.e., among the AVL-trees.  ...  ACM 20 (1977), no. 7, 519-526], allowing one to specify how the current state of affairs relates to the next one in the linear sequence of transformations that the program induces.  ... 

Inferring finite transducers

Erkki Mäkinen
2003 Journal of the Brazilian Computer Society  
We show that this problem can be solved in certain special cases by using known results on the inference problem for linear languages.  ...  Given pairs of input and output words, our task is to infer the finite transducer consistent with the given pairs.  ...  Theorem 3.2 Terminal-fixed even linear languages can be inferred from positive samples in linear time. Theorem 3.3 Almost terminal-fixed even linear languages can be inferred from positive samples.  ... 
doi:10.1590/s0104-65002003000200001 fatcat:cmtompw7fjfyzmwbrq2pp7hwri

A test of Generalized Bayesian dating: A new linguistic dating method

Taraka Rama, Søren Wichmann, Tony Robillard
2020 PLoS ONE  
We moreover introduce a way to overcome another potential source of subjectivity in Bayesian tree inference as commonly practiced, namely that of manual cognate identification; instead, we apply an automated  ...  Dates are obtained by fitting a Gamma regression model to tree lengths and known time depths for 30 phylogenetically independent calibration points.  ...  Instead, for each of the 30 language groups we fit a linear model in a leave-one-out fashion, basing the linear model on the remaining 29 calibration points.  ... 
doi:10.1371/journal.pone.0236522 pmid:32785236 fatcat:pubqafyexregjgjzoon2vpez3y

A stochastic memoizer for sequence data

Frank Wood, Cédric Archambeau, Jan Gasthaus, Lancelot James, Yee Whye Teh
2009 Proceedings of the 26th Annual International Conference on Machine Learning - ICML '09  
We introduce analytic marginalization steps (using coagulation operators) to reduce this model to one that can be represented in time and space linear in the length of the training sequence.  ...  We demonstrate the sequence memoizer by using it as a language model, achieving state-of-the-art results.  ...  One contribution of this paper to make inference in such a model tractable and efficient.  ... 
doi:10.1145/1553374.1553518 dblp:conf/icml/WoodAGJT09 fatcat:m5bqrz6s55dtlfhfi733zl23gq

A Probabilistic Approach to Language Change

Alexandre Bouchard-Côté, Percy Liang, Thomas L. Griffiths, Dan Klein
2007 Neural Information Processing Systems  
The result is an efficient inference procedure for automatically inferring ancient word forms from modern languages, which can be generalized to support inferences about linguistic phylogenies.  ...  We present a probabilistic approach to language change in which word forms are represented by phoneme sequences that undergo stochastic edits along the branches of a phylogenetic tree.  ...  Finally, models of this kind can potentially be used as a building block in a system for inferring the topology of phylogenetic trees [3] .  ... 
dblp:conf/nips/Bouchard-CoteLGK07 fatcat:2bv5hvl2tbgi5hufx7kk6myxju

A Generative Parser with a Discriminative Recognition Algorithm [article]

Jianpeng Cheng, Adam Lopez, Mirella Lapata
2017 arXiv   pre-print
We provide interpretations of the framework based on expectation maximization and variational inference, and show that it enables parsing and language modeling within a single implementation.  ...  On the English Penn Treen-bank, our framework obtains competitive performance on constituency parsing while matching the state-of-the-art single-model language modeling score.  ...  On the English Penn Treebank, we achieve competitive performance on constituency parsing and state-ofthe-art single-model language modeling score.  ... 
arXiv:1708.00415v2 fatcat:njuk5i77drgx7bvmvr6274cxm4

A Generative Parser with a Discriminative Recognition Algorithm

Jianpeng Cheng, Adam Lopez, Mirella Lapata
2017 Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 2: Short Papers)  
We provide interpretations of the framework based on expectation maximization and variational inference, and show that it enables parsing and language modeling within a single implementation.  ...  Generative models defining joint distributions over parse trees and sentences are useful for parsing and language modeling, but impose restrictions on the scope of features and are often outperformed by  ...  On the English Penn Treebank, we achieve competitive performance on constituency parsing and state-ofthe-art single-model language modeling score.  ... 
doi:10.18653/v1/p17-2019 dblp:conf/acl/ChengLL17 fatcat:aymzjbsfprdwfjrkhbf3wr5nyy

Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference [article]

Nikita Kitaev, Dan Klein
2020 arXiv   pre-print
After scoring, a left-to-right reconciliation phase extracts a tree in (empirically) linear time.  ...  Our parser achieves 95.4 F1 on the WSJ test set while also achieving substantial speedups compared to current state-of-the-art parsers with comparable accuracies.  ...  We, on the other hand, demonstrate how to leverage these same considerations to achieve parallel tagging and linear time complexity of the subsequent inference procedure.  ... 
arXiv:1904.09745v2 fatcat:g4yzsu6x5ne2dbw6gbjbb34jwi

An Empirical Study of Efficiency and Accuracy of Probabilistic Graphical Models

Jens Dalgaard Nielsen, Manfred Jaeger
2006 European Workshop on Probabilistic Graphical Models  
We also measure accuracy and efficiency empirically by running exact inference algorithms on randomly generated queries.  ...  However, our results also show that the advantage of the low complexity inference provided by NB models is not as significant as assessed in a previous study.  ...  The first observation we make from table 2 is that no single model language consistently dominates the others.  ... 
dblp:conf/pgm/NielsenJ06 fatcat:2ubpcwodwbdu5hraslzqd6qocu

Representations of the language recognition problem for a theorem prover

Jack Minker, Gordon J. VanderBrug
1974 International Journal of Computer & Information Sciences  
In particular, th'e end-order traversal of the parse tree is derived in one of the representations.  ...  One of the representations is based on the familiar method of generating sentential forms of the language, and the other is based on the Cocke parsing algorithm.  ...  Figure 4 Figure 4 . 3 443 An input proof in linear form in the derivation tree representation.  ... 
doi:10.1007/bf00977256 fatcat:dg44xloa5rb4rh52kxn5ej5ske
« Previous Showing results 1 — 15 out of 77,443 results