Moses-support Digest, Vol 123, Issue 11

Send Moses-support mailing list submissions to
moses-support@mit.edu

To subscribe or unsubscribe via the World Wide Web, visit
http://mailman.mit.edu/mailman/listinfo/moses-support
or, via email, send a message with subject or body 'help' to
moses-support-request@mit.edu

You can reach the person managing the list at
moses-support-owner@mit.edu

When replying, please edit your Subject line so it is more specific
than "Re: Contents of Moses-support digest..."


Today's Topics:

1. Re: Error while installing moses (Hieu Hoang)
2. Feature name PhraseDictionaryCompact is not registered
(Hongzheng Li)
3. Re: Feature name PhraseDictionaryCompact is not registered
(Hieu Hoang)
4. CfP: TextGraphs-11: Graph-based Methods for Natural Language
Processing, ACL 2017 (Martin Riedl)


----------------------------------------------------------------------

Message: 1
Date: Sat, 21 Jan 2017 22:41:34 +0000
From: Hieu Hoang <hieuhoang@gmail.com>
Subject: Re: [Moses-support] Error while installing moses
To: Sonal khosla <sonal.khosla@rediffmail.com>, moses-support@mit.edu
Message-ID: <322ac282-ef0e-4b94-70b6-e6234efc9224@gmail.com>
Content-Type: text/plain; charset="windows-1252"

I think there's a problem with your xmlrpc-c library, the default on
Ubuntu 14.04 may be too old for moses.

If you don't need moses server or Moses2, then add this argument when
compiling:
--no-xmlrpc-c
If you do need it, then download and compiled the xmlrpc-c library
separately and add the argument:
--with-xmlrpc-c=[path to xmlrpc-c lib]
eg.
./bjam --with-xmlrpc-c=/home/hieu/workspace/xmlrpc-c/xmlrpc-c-1.39.12


On 21/01/2017 12:49, Sonal khosla wrote:
> Hi all,
>
> I am trying installing Moses on Ubuntu 14.04. this is the sequence of
> commands I executed for the installation.
>
> sudo apt-get install g++ git subversion automake libtool zlib1g-dev
> libboost-all-dev libbz2-dev liblzma-dev python-dev libtcmalloc-minimal4
>
> wget
> http://downloads.sourceforge.net/project/boost/boost/1.55.0/boost_1_55_0.tar.gzr=http%3A%2F%2Fsourceforge.net%2Fprojects%2Fboost%2Ffiles%2Fboost%2F1.55.0%2F&ts=13
> tar zxvf boost_1_55_0.tar.gz
> cd boost_1_55_0/
> ./bootstrap.sh
> ./b2 -j5 --prefix=$PWD --libdir=$PWD/lib64 --layout=tagged link=static
> threading=multi,single install || echo FAILURE
>
>
>
> git clone https://github.com/moses-smt/mosesdecoder.git
> cd mosesdecoder/
> ./bjam -j5
>
> After this command I got the error "Build Failed"
> Also sharing the error logs
>
>
>
> _______________________________________________
> Moses-support mailing list
> Moses-support@mit.edu
> http://mailman.mit.edu/mailman/listinfo/moses-support

--
Hieu Hoang
http://moses-smt.org/

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.mit.edu/mailman/private/moses-support/attachments/20170121/caa25796/attachment-0001.html

------------------------------

Message: 2
Date: Sat, 21 Jan 2017 18:00:03 -0500
From: Hongzheng Li <lihongzheng1990@gmail.com>
Subject: [Moses-support] Feature name PhraseDictionaryCompact is not
registered
To: Moses-support@mit.edu
Message-ID:
<CAAjZO5YzWpiPCCgqAVdOmvO+EygD0887h5mAK_ujmeLNZ0UotA@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"

Hi there:

I'm testing the moses following the instructions on the website, but I got
the following errors:
*Exception: moses/FF/Factory.cpp:386 in void
Moses::FeatureRegistry::Construct(const string&, const string&) threw
UnknownFeatureException because `i == registry_.end()'.*
*Feature name PhraseDictionaryCompact is not registered*

Although I have already compiled moses with cmph, I still recompiled it
again with the command:
./bjam --with-cmph=/u/lihongzh/Desktop/Moses/cmph-2.0/
Compiling succeeded, but testing failed.
I then tried "./bjam --with-cmph=/u/lihongzh/Desktop/Moses/cmph-2.0/ -a "
once again. Compiling succeeded, but testing still failed, with the same
above error.

I'm so confused now, What should I do to solve the problem?

Best,

Hongzheng Li
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.mit.edu/mailman/private/moses-support/attachments/20170121/448f4e22/attachment-0001.html

------------------------------

Message: 3
Date: Sat, 21 Jan 2017 23:20:22 +0000
From: Hieu Hoang <hieuhoang@gmail.com>
Subject: Re: [Moses-support] Feature name PhraseDictionaryCompact is
not registered
To: Hongzheng Li <lihongzheng1990@gmail.com>
Cc: moses-support <moses-support@mit.edu>
Message-ID:
<CAEKMkbjqTqms8J1qVpda719a0rz50sj1AcYOtONpTaNKRst2mA@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"

what is the EXACT command you used to run the decoder? Can you please
attach your moses.ini file so I can check it.

Hieu Hoang
http://moses-smt.org/

On 21 January 2017 at 23:00, Hongzheng Li <lihongzheng1990@gmail.com> wrote:

> Hi there:
>
> I'm testing the moses following the instructions on the website, but I got
> the following errors:
> *Exception: moses/FF/Factory.cpp:386 in void
> Moses::FeatureRegistry::Construct(const string&, const string&) threw
> UnknownFeatureException because `i == registry_.end()'.*
> *Feature name PhraseDictionaryCompact is not registered*
>
> Although I have already compiled moses with cmph, I still recompiled it
> again with the command:
> ./bjam --with-cmph=/u/lihongzh/Desktop/Moses/cmph-2.0/
> Compiling succeeded, but testing failed.
> I then tried "./bjam --with-cmph=/u/lihongzh/Desktop/Moses/cmph-2.0/ -a "
> once again. Compiling succeeded, but testing still failed, with the same
> above error.
>
> I'm so confused now, What should I do to solve the problem?
>
> Best,
>
> Hongzheng Li
>
>
>
> _______________________________________________
> Moses-support mailing list
> Moses-support@mit.edu
> http://mailman.mit.edu/mailman/listinfo/moses-support
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.mit.edu/mailman/private/moses-support/attachments/20170121/62a000cb/attachment-0001.html

------------------------------

Message: 4
Date: Wed, 18 Jan 2017 19:04:23 +0100
From: Martin Riedl <riedl@cs.tu-darmstadt.de>
Subject: [Moses-support] CfP: TextGraphs-11: Graph-based Methods for
Natural Language Processing, ACL 2017
To: Verborgene_Empfaenger: ;
Message-ID: <1fdd2df2-c748-ebf7-8f58-5214e7f73c79@cs.tu-darmstadt.de>
Content-Type: text/plain; charset=utf-8; format=flowed

======================================================================
CALL FOR PAPERS

TextGraphs-11: Graph-based Methods for Natural Language Processing

Workshop at the 55th Annual Meeting of the Association for Computational
Linguistics (ACL 2017)

Vancouver, Canada

http://www.textgraphs.org/ws17

======================================================================
WORKSHOP DESCRIPTION
======================================================================
For the past eleven years, the workshops in the TextGraphs series have
published and promoted the synergy between the field of Graph Theory
(GT) and Natural Language Processing (NLP). The eleventh edition of the
TextGraphs workshop aims to extend the focus on issues and solutions for
large-scale graphs, such as those derived for web- scale knowledge
acquisition or social networks. We plan to encourage the de-scription of
novel NLP problems or applications that have emerged in recent years,
which can be addressed with existing and new graph-based methods.
Furthermore, we will also encourage research on applications of
graph-based methods in the area of Semantic Web in order to link them to
related NLP problems and applications.
The target audience comprises researchers working on problems related to
either Graph Theory or graph-based algorithms applied to Natural
Language Processing, social media, and the Semantic Web.

======================================================================
SPECIAL TOPIC
======================================================================
In a novel and exciting extension, we will encourage graph-based
interpretations of deep learning models for NLP tasks. Though deep
learning models are displaying state-of-the-art performance on many NLP
tasks, they are often criticized for not being interpretable (due to
their various layers and large number of parameters). In the
TextGraphs-11 workshop we will introduce a new challenge for graph-based
methods: the development of methods for reasoning and interpretation of
the layers used in deep learning models. Given that a neural network is,
from one point of view, nothing but a graph through which activation
scores are propagated, many of the existing graph-based methods used in
our workshop community could potentially apply. Can a graph-based
perspective help provide insights for making deep processing
comprehensible for humans and computers? What are the capabilities and
limits when graph-based methods are applied to neural networks in
general? Which aspects of the networks are not susceptible to such
treatment, and why not?

======================================================================
WORKSHOP TOPICS
======================================================================
TextGraphs-11 invites submissions on (but not limited to) the following
topics:
* Graph-based methods for providing reasoning and interpretation of
deep learning methods
* Graph-based methods for reasoning and interpreting deep processing
by neural networks,
* Explorations of the capabilities and limits when graph-based
methods are applied to neural networks,
* Investigation of which aspects of neural networks are not amenable
to graph-based methods.
* Graph-based methods for Information Retrieval, Information
Extraction, and Text Mining
* Graph-based methods for word sense disambiguation,
* Graph-based representations for ontology learning,
* Graph-based strategies for semantic relations identification,
* Encoding semantic distances in graphs,
* Graph-based techniques for text summarization,simplification,and
paraphrasing,
* Graph-based techniques for document navigation and visualization,
* Reranking with graphs,
* Applications of label propagation algorithms, etc.
* New graph-based methods for NLP applications, and novel use of
existing graph methods for new NLP tasks
* Random walk methods in graphs,
* Spectral graph clustering,
* Semi-supervised graph-based methods,
* Methods and analyses for statistical networks,
* Small world graphs,
* Dynamic graph representations,
* Topological and pre-topological analysis of graphs,
* Graph kernels, etc.
* Graph-based methods for applications on social networks
* Rumor proliferation,
* E-reputation,
* Multiple identity detection,
* Language dynamics studies,
* Surveillance systems, etc.
* Graph-based methods for NLP and Semantic Web
* Representation learning methods for knowledge graphs (e.g.,
knowledge graph embedding),
* Using graphs-based methods to populate ontologies using textual data,
* Inducing knowledge of ontologies into NLP applications using graphs,
* Merging ontologies with graph-based methods using NLP techniques.

======================================================================
IMPORTANT DATES
======================================================================
All submission deadlines are at 11:59 p.m. PST

Paper submission: April 21, 2017
Notification of acceptance: May 19, 2017
Camera-ready submission: May 26, 2017
Workshop date: August 3 or 4, 2017

======================================================================
SUBMISSION
======================================================================
TextGraphs-11 solicits both long and short paper submissions.

Long paper submissions must describe substantial, original, completed
and unpublished work. Wherever appropriate, concrete evaluation and
analysis should be included. Long papers may consist of up to eight (8)
pages of content, plus two pages of references. Final versions of long
papers will be given one additional page of content (up to 9 pages) to
address reviewers? remarks.

Short paper submissions must describe original and unpublished work.
Please note that a short paper is not a shortened long paper. Instead
short papers should have a point that can be made in a few pages. Short
papers may consist of up to four (4) pages of content, plus one page of
references. Upon acceptance, short papers will also be given one
additional content page (up to 5 content pages) in the proceedings.

Both long and short paper submissions must follow the two-column format
of ACL 2017 proceedings. We strongly recommend the use of ACL LaTeX
style files tailored for ACL 2017 conference. Submissions must conform
to the official style guidelines, which are contained in the style
files, and they must be in PDF format. Style files and other information
about paper formatting requirements can be found at the ACL 2017 website.

Submission is electronic, using the SoftConf START conference management
system:
https://www.softconf.com/acl2017/textgraphs/

======================================================================
BEST PAPER AWARD
======================================================================
The Program Committee will select a best paper submitted to
TextGraphs-11. The authors of the best manuscript will receive the
valuable Best Paper Award. Both long and short submissions will be taken
in consideration for the Best Paper Award.

======================================================================
PROGRAM COMMITTEE (in alphabetic order)
======================================================================
* Sivaji Bandyopadhyay, Jadavpur University, Kolkata, India
* Pushpak Bhattacharyya, IIT Bombay, India
* Chris Biemann, University of Hamburg, Germany
* Tanmoy Chakraborty, University of Maryland, USA
* Asif Ekbar, Indian Institute of Technology, Patna, India
* Marc Franco Salvador, University of Valencia, Spain
* Ioana Hulpus, University of Mannheim, Germany
* Roman Klinger, University of Stuttgart, Germany
* Nikola Ljubes??, University of Zagreb, Croatia
* He?tor Mart?nez Alonso, Inria & University Paris Diderot, France
* Gabor Melli, VigLink, USA
* Rada Mihalcea, University of Michigan, USA
* Alessandro Moschitti, University of Trento, Italy
* Animesh Mukherjee, IIT Kharagpur, India
* Vivi Nastase, Heidelberg University, Germany
* Roberto Navigli, ?La Sapienza? University of Rome, Italy
* Alexander Panchenko, University of Hamburg, Germany
* Simone Paolo Ponzetto, University of Mannheim, Germany
* Steffen Remus, University of Hamburg, Germany
* Stephan Roller, UT Austin, USA
* Shourya Roy, Xerox Research, India
* Anders S?gaard, University of Copenhagen, Denmark
* Jan S?ajder, University of Zagreb, Croatia
* Aline Villavicencio, F. University of Rio Grande do Sul, Brazil
* Ivan Vuli?, University of Cambridge, United Kingdom
* Fabio Massimo Zanzotto, ?Tor vergata? University of Rome, Italy
======================================================================
ORGANIZERS
======================================================================
Martin Riedl, University of Hamburg
riedl@informatik.uni-hamburg.de

Swapna Somasundaran, Educational Testing Services
ssomasundaran@ets.org

Goran Glava?, University of Mannheim
goran@informatik.uni-mannheim.de

Eduard Hovy, Carnegie Mellon University
hovy@cmu.edu
======================================================================


------------------------------

_______________________________________________
Moses-support mailing list
Moses-support@mit.edu
http://mailman.mit.edu/mailman/listinfo/moses-support


End of Moses-support Digest, Vol 123, Issue 11
**********************************************

Tweet