Popularity
3.7
Declining
Activity
0.0
Stable
7
3
0
Monthly Downloads: 14
Programming language: Haskell
License: LicenseRef-LGPL
Latest version: v0.0.8
PTQ alternatives and similar packages
Based on the "Natural Language Processing" category.
Alternatively, view PTQ alternatives based on common mentions on social networks and blogs.
-
concraft-pl
A morphosyntactic tagger for Polish based on conditional random fields -
concraft
A morphosyntactic disambiguation library based on constrained conditional random fields -
minimorph
English spelling functions with an emphasis on simplicity. Originally by https://github.com/kowey. -
hist-pl
Programs and libraries related to the historical dictionary of Polish -
polh-lexicon
Programs and libraries related to the historical dictionary of Polish -
sentiwordnet-parser
Parser for the [SentiWordNet](http://sentiwordnet.isti.cnr.it/) tab-separated file -
crf-chain2-tiers
Second-order, tiered, constrained, linear conditional random fields -
penntreebank-megaparsec
Megaparsec parsers for trees in the Penn Treebank format -
concraft-hr
A part-of-speech tagger for Croatian based on the concraft library.
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
Promo
www.influxdata.com
Do you think we are missing an alternative of PTQ or a related project?
README
An implementation of Montague's PTQ in Haskell
Build and Install
% cabal configure
% cabal build
% cabal install
Usage of interactive shell ptq
% ptq
PTQ> John seeks a unicorn.
Parsed:
F4 john (F5 seek (F2 a unicorn))
Translation:
(\x0. x0 {john}) (Int (seek (Int ((\x0. \x1. exists x2. x0 {x2} && x1 {x2}) (Int unicorn)))))
Translation (simplified):
seek (Int (\x0. exists x1. unicorn x1 && x0 {x1})) john
------------------------------------------------------
Parsed:
F10 0 (F2 a unicorn) (F4 john (F5 seek (He 0)))
Translation:
(\x0. \x1. exists x2. x0 {x2} && x1 {x2}) (Int unicorn) (Int (\x0. (\x1. x1 {john}) (Int (seek (Int (\x1. x1 {x0}))))))
Translation (simplified):
exists x0. unicorn x0 && seek (Int (\x1. x1 {x0})) john
PTQ> quit
%
CGI interface
By locating ptq.cgi, cgi/index.html and cgi/main.html to the place where CGI is executable, you can try it on the web. Demo site runs at http://www.tom.sfc.keio.ac.jp/~sakai/hsPTQ/ (currently not working).
Haste interface
You can use Haste to compile haste/* and run on your browsers. Demo site runs at http://msakai.github.io/ptq/demo/index.html.