ovos-padatious 0.1.0__tar.gz

ovos-padatious-0.1.0/LICENSE

@@ -0,0 +1,53 @@
+Apache License
+
+Version 2.0, January 2004
+
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+You must give any other recipients of the Work or Derivative Works a copy of this License; and
+You must cause any modified files to carry prominent notices stating that You changed the files; and
+You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. 
+
+You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS

ovos-padatious-0.1.0/MANIFEST.in

@@ -0,0 +1,3 @@
+include LICENSE
+include requirements.txt
+recursive-include tests *.py

ovos-padatious-0.1.0/PKG-INFO

@@ -0,0 +1,91 @@
+Metadata-Version: 2.1
+Name: ovos-padatious
+Version: 0.1.0
+Summary: A neural network intent parser
+Home-page: https://github.com/OpenVoiceOS/ovos-padatious-pipeline-plugin
+Author: Matthew Scholefield
+License: Apache-2.0
+Description: [![License](https://img.shields.io/badge/License-Apache%202.0-blue.svg)](LICENSE.md) 
+        # Padatious
+        
+        An efficient and agile neural network intent parser.
+        
+        This repository contains a OVOS pipeline plugin and bundles a fork of the original [padatious](https://github.com/MycroftAI/padatious) from the defunct MycroftAI
+        
+        
+        ## Features
+        
+         - Intents are easy to create
+         - Requires a relatively small amount of data
+         - Intents run independent of each other
+         - Easily extract entities (ie. Find the nearest *gas station* -> `place: gas station`)
+         - Fast training with a modular approach to neural networks
+        
+        ## Getting Started
+        
+        ### Installing
+        
+        Padatious requires the following native packages to be installed:
+        
+         - [`FANN`][fann] (with dev headers)
+         - Python development headers
+         - `pip3`
+         - `swig`
+        
+        Ubuntu:
+        
+        ```
+        sudo apt-get install libfann-dev python3-dev python3-pip swig libfann-dev python3-fann2
+        ```
+        
+        Next, install Padatious via `pip3`:
+        
+        ```
+        pip3 install padatious
+        ```
+        Padatious also works in Python 2 if you are unable to upgrade.
+        
+        
+        [fann]:https://github.com/libfann/fann
+        
+        ### Example
+        
+        Here's a simple example of how to use Padatious:
+        
+        #### program.py
+        
+        ```Python
+        from ovos_padatious import IntentContainer
+        
+        container = IntentContainer('intent_cache')
+        container.add_intent('hello', ['Hi there!', 'Hello.'])
+        container.add_intent('goodbye', ['See you!', 'Goodbye!'])
+        container.add_intent('search', ['Search for {query} (using|on) {engine}.'])
+        container.train()
+        
+        print(container.calc_intent('Hello there!'))
+        print(container.calc_intent('Search for cats on CatTube.'))
+        
+        container.remove_intent('goodbye')
+        ```
+        
+        
+Keywords: intent-parser parser text text-processing
+Platform: UNKNOWN
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Topic :: Text Processing :: Linguistic
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 2
+Classifier: Programming Language :: Python :: 2.7
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.0
+Classifier: Programming Language :: Python :: 3.1
+Classifier: Programming Language :: Python :: 3.2
+Classifier: Programming Language :: Python :: 3.3
+Classifier: Programming Language :: Python :: 3.4
+Classifier: Programming Language :: Python :: 3.5
+Classifier: Programming Language :: Python :: 3.6
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Description-Content-Type: text/markdown

ovos-padatious-0.1.0/README.md

@@ -0,0 +1,64 @@
+[![License](https://img.shields.io/badge/License-Apache%202.0-blue.svg)](LICENSE.md) 
+# Padatious
+
+An efficient and agile neural network intent parser.
+
+This repository contains a OVOS pipeline plugin and bundles a fork of the original [padatious](https://github.com/MycroftAI/padatious) from the defunct MycroftAI
+
+
+## Features
+
+ - Intents are easy to create
+ - Requires a relatively small amount of data
+ - Intents run independent of each other
+ - Easily extract entities (ie. Find the nearest *gas station* -> `place: gas station`)
+ - Fast training with a modular approach to neural networks
+
+## Getting Started
+
+### Installing
+
+Padatious requires the following native packages to be installed:
+
+ - [`FANN`][fann] (with dev headers)
+ - Python development headers
+ - `pip3`
+ - `swig`
+
+Ubuntu:
+
+```
+sudo apt-get install libfann-dev python3-dev python3-pip swig libfann-dev python3-fann2
+```
+
+Next, install Padatious via `pip3`:
+
+```
+pip3 install padatious
+```
+Padatious also works in Python 2 if you are unable to upgrade.
+
+
+[fann]:https://github.com/libfann/fann
+
+### Example
+
+Here's a simple example of how to use Padatious:
+
+#### program.py
+
+```Python
+from ovos_padatious import IntentContainer
+
+container = IntentContainer('intent_cache')
+container.add_intent('hello', ['Hi there!', 'Hello.'])
+container.add_intent('goodbye', ['See you!', 'Goodbye!'])
+container.add_intent('search', ['Search for {query} (using|on) {engine}.'])
+container.train()
+
+print(container.calc_intent('Hello there!'))
+print(container.calc_intent('Search for cats on CatTube.'))
+
+container.remove_intent('goodbye')
+```
+

ovos-padatious-0.1.0/ovos_padatious/__init__.py

@@ -0,0 +1,18 @@
+# Copyright 2017 Mycroft AI, Inc.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+from .intent_container import IntentContainer
+from .match_data import MatchData
+
+__version__ = '0.4.8'  # Also change in setup.py

ovos-padatious-0.1.0/ovos_padatious/__main__.py

@@ -0,0 +1,58 @@
+import inspect
+import json
+from os.path import basename, splitext
+
+from argparse import ArgumentParser
+
+from ovos_padatious import IntentContainer
+
+
+def train_setup(parser):
+    parser.add_argument('intent_cache', help='Folder to write trained intents to')
+    parser.add_argument('input_files', nargs='*', help='Input .intent and .entity files')
+    parser.add_argument('-d', '--data', help='Serialized training args', type=json.loads)
+    parser.add_argument('-s', '--single-thread', help='Run training in a single thread')
+    parser.add_argument('-f', '--force', help='Force retraining if already trained')
+    parser.add_argument('-a', '--args', help='Extra args (list) for function', type=json.loads)
+    parser.add_argument('-k', '--kwargs', help='Extra kwargs (json) for function', type=json.loads)
+
+
+def train(parser, args):
+    if bool(args.input_files) == bool(args.data):
+        parser.error('You must specify one of input_files or --data (but not both)')
+
+    cont = IntentContainer(args.intent_cache)
+    if args.data:
+        cont.apply_training_args(args.data)
+    else:
+        for fn in args.input_files:
+            obj_name, ext = splitext(basename(fn))
+            if ext == '.intent':
+                cont.load_intent(obj_name, fn)
+            elif ext == '.entity':
+                cont.load_entity(obj_name, fn)
+            else:
+                parser.error('Unknown file extension: {}'.format(ext))
+    kwargs = inspect.signature(cont.train).bind(*(args.args or [])).arguments
+    kwargs.update(args.kwargs or {})
+    kwargs.setdefault('debug', True)
+    kwargs.setdefault('single_thread', args.single_thread)
+    kwargs.setdefault('force', args.force)
+    if cont.train(**kwargs):
+        return 0
+    return 10  # timeout
+
+
+def main():
+    parser = ArgumentParser(description='Tool to interact with ovos_padatious via command line')
+    p = parser.add_subparsers(dest='action')
+    p.required = True
+    train_setup(p.add_parser('train'))
+
+    args = parser.parse_args()
+    if args.action == 'train':
+        exit(train(parser, args))
+
+
+if __name__ == '__main__':
+    main()

ovos-padatious-0.1.0/ovos_padatious/bracket_expansion.py

@@ -0,0 +1,183 @@
+# Copyright 2017 Mycroft AI, Inc.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+
+class Fragment(object):
+    """(Abstract) empty sentence fragment"""
+
+    def __init__(self, tree):
+        """
+        Construct a sentence tree fragment which is merely a wrapper for
+        a list of Strings
+
+        Args:
+            tree (?): Base tree for the sentence fragment, type depends on
+                        subclass, refer to those subclasses
+        """
+        self._tree = tree
+
+    def tree(self):
+        """Return the represented sentence tree as raw data."""
+        return self._tree
+
+    def expand(self):
+        """
+        Expanded version of the fragment. In this case an empty sentence.
+
+        Returns:
+            List<List<str>>: A list with an empty sentence (= token/string list)
+        """
+        return [[]]
+
+    def __str__(self):
+        return self._tree.__str__()
+
+    def __repr__(self):
+        return self._tree.__repr__()
+
+
+class Word(Fragment):
+    """
+    Single word in the sentence tree.
+
+    Construct with a string as argument.
+    """
+
+    def expand(self):
+        """
+        Creates one sentence that contains exactly that word.
+
+        Returns:
+            List<List<str>>: A list with the given string as sentence
+                                (= token/string list)
+        """
+        return [[self._tree]]
+
+
+class Sentence(Fragment):
+    """
+    A Sentence made of several concatenations/words.
+
+    Construct with a List<Fragment> as argument.
+    """
+
+    def expand(self):
+        """
+        Creates a combination of all sub-sentences.
+
+        Returns:
+            List<List<str>>: A list with all subsentence expansions combined in
+                                every possible way
+        """
+        old_expanded = [[]]
+        for sub in self._tree:
+            sub_expanded = sub.expand()
+            new_expanded = []
+            while len(old_expanded) > 0:
+                sentence = old_expanded.pop()
+                for new in sub_expanded:
+                    new_expanded.append(sentence + new)
+            old_expanded = new_expanded
+        return old_expanded
+
+
+class Options(Fragment):
+    """
+    A Combination of possible sub-sentences.
+
+    Construct with List<Fragment> as argument.
+    """
+
+    def expand(self):
+        """
+        Returns all of its options as seperated sub-sentences.
+
+        Returns:
+            List<List<str>>: A list containing the sentences created by all
+                                expansions of its sub-sentences
+        """
+        options = []
+        for option in self._tree:
+            options.extend(option.expand())
+        return options
+
+
+class SentenceTreeParser(object):
+    """
+    Generate sentence token trees from a list of tokens
+    ['1', '(', '2', '|', '3, ')'] -> [['1', '2'], ['1', '3']]
+    """
+
+    def __init__(self, tokens):
+        self.tokens = tokens
+
+    def _parse(self):
+        """
+        Generate sentence token trees
+        ['1', '(', '2', '|', '3, ')'] -> ['1', ['2', '3']]
+        """
+        self._current_position = 0
+        return self._parse_expr()
+
+    def _parse_expr(self):
+        """
+        Generate sentence token trees from the current position to
+        the next closing parentheses / end of the list and return it
+        ['1', '(', '2', '|', '3, ')'] -> ['1', [['2'], ['3']]]
+        ['2', '|', '3'] -> [['2'], ['3']]
+        """
+        # List of all generated sentences
+        sentence_list = []
+        # Currently active sentence
+        cur_sentence = []
+        sentence_list.append(Sentence(cur_sentence))
+        # Determine which form the current expression has
+        while self._current_position < len(self.tokens):
+            cur = self.tokens[self._current_position]
+            self._current_position += 1
+            if cur == '(':
+                # Parse the subexpression
+                subexpr = self._parse_expr()
+                # Check if the subexpression only has one branch
+                # -> If so, append "(" and ")" and add it as is
+                normal_brackets = False
+                if len(subexpr.tree()) == 1:
+                    normal_brackets = True
+                    cur_sentence.append(Word('('))
+                # add it to the sentence
+                cur_sentence.append(subexpr)
+                if normal_brackets:
+                    cur_sentence.append(Word(')'))
+            elif cur == '|':
+                # Begin parsing a new sentence
+                cur_sentence = []
+                sentence_list.append(Sentence(cur_sentence))
+            elif cur == ')':
+                # End parsing the current subexpression
+                break
+            # TODO anything special about {sth}?
+            else:
+                cur_sentence.append(Word(cur))
+        return Options(sentence_list)
+
+    def _expand_tree(self, tree):
+        """
+        Expand a list of sub sentences to all combinated sentences.
+        ['1', ['2', '3']] -> [['1', '2'], ['1', '3']]
+        """
+        return tree.expand()
+
+    def expand_parentheses(self):
+        tree = self._parse()
+        return self._expand_tree(tree)

ovos-padatious-0.1.0/ovos_padatious/entity.py

@@ -0,0 +1,50 @@
+# Copyright 2017 Mycroft AI, Inc.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+from os.path import join
+
+from ovos_padatious.simple_intent import SimpleIntent
+from ovos_padatious.trainable import Trainable
+
+
+class Entity(SimpleIntent, Trainable):
+    def __init__(self, name, *args, **kwargs):
+        SimpleIntent.__init__(self, name)
+        Trainable.__init__(self, name, *args, **kwargs)
+
+    @staticmethod
+    def verify_name(token):
+        if token[0] in '{}' or token[-1] in '{}':
+            raise ValueError('token must not be surrounded in braces (ie. {word} should be word)')
+
+    @staticmethod
+    def wrap_name(name):
+        """Wraps SkillName:entity into SkillName:{entity}"""
+        if ':' in name:
+            parts = name.split(':')
+            intent_name, ent_name = parts[0], parts[1:]
+            return intent_name + ':{' + ':'.join(ent_name) + '}'
+        else:
+            return '{' + name + '}'
+
+    def save(self, folder):
+        prefix = join(folder, self.name)
+        SimpleIntent.save(self, prefix)
+        self.save_hash(prefix)
+
+    @classmethod
+    def from_file(cls, name, folder):
+        self = super(Entity, cls).from_file(name, join(folder, name))
+        self.load_hash(join(folder, name))
+        return self

ovos-padatious-0.1.0/ovos_padatious/entity_edge.py

@@ -0,0 +1,123 @@
+# Copyright 2017 Mycroft AI, Inc.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+
+from fann2 import libfann as fann
+
+from ovos_padatious.id_manager import IdManager
+from ovos_padatious.util import StrEnum, resolve_conflicts
+
+
+class Ids(StrEnum):
+    end = ':end'
+
+
+class EntityEdge(object):
+    """
+    Represents the left or right side of an entity (a PosIntent)
+
+    Args:
+        direction (int): -1 for left and +1 for right
+        token (str): token to attach to (something like {word})
+        intent_name (str): name of parent intent
+    """
+    def __init__(self,  direction, token, intent_name):
+        self.ids = IdManager(Ids)
+        self.intent_name = intent_name
+        self.token = token
+        self.dir = direction
+        self.net = None
+
+    def get_end(self, sent):
+        return len(sent) if self.dir > 0 else -1
+
+    def vectorize(self, sent, pos):
+        unknown = 0
+        vector = self.ids.vector()
+        end_pos = self.get_end(sent)
+        for i in range(pos + self.dir, end_pos, self.dir):
+            if sent[i] in self.ids:
+                self.ids.assign(vector, sent[i], 1.0 / abs(i - pos))
+            else:
+                unknown += 1
+        self.ids.assign(vector, Ids.end, 1.0 / abs(end_pos - pos))
+        return vector
+
+    def match(self, sent, pos):
+        return self.net.run(self.vectorize(sent, pos))[0]
+
+    def configure_net(self):
+        layers = [len(self.ids), 3, 1]
+
+        self.net = fann.neural_net()
+        self.net.create_standard_array(layers)
+        self.net.set_activation_function_hidden(fann.SIGMOID_SYMMETRIC_STEPWISE)
+        self.net.set_activation_function_output(fann.SIGMOID_STEPWISE)
+        self.net.set_train_stop_function(fann.STOPFUNC_BIT)
+        self.net.set_bit_fail_limit(0.1)
+
+    def save(self, prefix):
+        prefix += '.' + {-1: 'l', +1: 'r'}[self.dir]
+        self.net.save(str(prefix + '.net'))  # Must have str()
+        self.ids.save(prefix)
+
+    def load(self, prefix):
+        prefix += '.' + {-1: 'l', +1: 'r'}[self.dir]
+        self.net = fann.neural_net()
+        if not self.net.create_from_file(str(prefix + '.net')):  # Must have str()
+            raise FileNotFoundError(str(prefix + '.net'))
+        self.ids.load(prefix)
+
+    def train(self, train_data):
+        for sent in train_data.my_sents(self.intent_name):
+            if self.token in sent:
+                for i in range(sent.index(self.token) + self.dir,
+                               self.get_end(sent), self.dir):
+                    if sent[i][0] != '{':
+                        self.ids.add_token(sent[i])
+
+        inputs, outputs = [], []
+
+        def pollute(sent, i, out_val):
+            """Simulates multiple token words in adjacent entities"""
+            for j, check_token in enumerate(sent):
+                d = j - i
+                if int(d > 0) - int(d < 0) == self.dir and check_token.startswith('{'):
+                    for pol_len in range(1, 4):
+                        s = sent[:j] + [':0'] * pol_len + sent[j + 1:]
+                        p = i + (pol_len - 1) * int(self.dir < 0)
+                        inputs.append(self.vectorize(s, p))
+                        outputs.append([out_val])
+
+        def add_sents(sents, out_fn):
+            for sent in sents:
+                for i, token in enumerate(sent):
+                    out_val = out_fn(token)
+                    inputs.append(self.vectorize(sent, i))
+                    outputs.append([out_val])
+                    if out_val == 1.0:
+                        pollute(sent, i, 1.0)
+
+        add_sents(train_data.my_sents(self.intent_name), lambda x: float(x == self.token))
+        add_sents(train_data.other_sents(self.intent_name), lambda x: 0.0)
+        inputs, outputs = resolve_conflicts(inputs, outputs)
+
+        data = fann.training_data()
+        data.set_train_data(inputs, outputs)
+
+        for _ in range(10):
+            self.configure_net()
+            self.net.train_on_data(data, 1000, 0, 0)
+            self.net.test_data(data)
+            if self.net.get_bit_fail() == 0:
+                break