summary refs log tree commit diff stats
path: root/generator/lemma.h
diff options
context:
space:
mode:
authorKelly Rauchenberger <fefferburbia@gmail.com>2017-01-16 18:02:50 -0500
committerKelly Rauchenberger <fefferburbia@gmail.com>2017-01-16 18:02:50 -0500
commit6746da6edd7d9d50efe374eabbb79a3cac882d81 (patch)
treeff20917e08b08d36b9541c1371106596e7bec442 /generator/lemma.h
parent4af7e55733098ca42f75a4ffaca1b0f6bab4dd36 (diff)
downloadverbly-6746da6edd7d9d50efe374eabbb79a3cac882d81.tar.gz
verbly-6746da6edd7d9d50efe374eabbb79a3cac882d81.tar.bz2
verbly-6746da6edd7d9d50efe374eabbb79a3cac882d81.zip
Started structural rewrite
The new object structure was designed to build on the existing WordNet
structure, while also adding in all of the data that we get from other sources.
More information about this can be found on the project wiki.

The generator has already been completely rewritten to generate a
datafile that uses the new structure. In addition, a number of indexes
are created, which does double the size of the datafile, but also allows
for much faster lookups. Finally, the new generator is written modularly
and is a lot more readable than the old one.

The verbly interface to the new object structure has mostly been
completed, but has not been tested fully. There is a completely new
search API which utilizes a lot of operator overloading; documentation
on how to use it should go up at some point.

Token processing and verb frames are currently unimplemented. Source for
these have been left in the repository for now.
Diffstat (limited to 'generator/lemma.h')
-rw-r--r--generator/lemma.h58
1 files changed, 58 insertions, 0 deletions
diff --git a/generator/lemma.h b/generator/lemma.h new file mode 100644 index 0000000..6452e08 --- /dev/null +++ b/generator/lemma.h
@@ -0,0 +1,58 @@
1#ifndef LEMMA_H_D73105A7
2#define LEMMA_H_D73105A7
3
4#include <string>
5#include <map>
6#include <set>
7#include "enums.h"
8
9namespace verbly {
10 namespace generator {
11
12 class database;
13 class form;
14
15 class lemma {
16 public:
17
18 // Constructors
19
20 explicit lemma(const form& baseForm);
21
22 // Mutators
23
24 void addInflection(inflection type, const form& f);
25
26 // Accessors
27
28 int getId() const
29 {
30 return id_;
31 }
32
33 const form& getBaseForm() const
34 {
35 return baseForm_;
36 }
37
38 std::set<const form*> getInflections(inflection type) const;
39
40 private:
41
42 static int nextId_;
43
44 const int id_;
45 const form& baseForm_;
46
47 std::map<inflection, std::set<const form*>> inflections_;
48
49 };
50
51 // Serializer
52
53 database& operator<<(database& db, const lemma& arg);
54
55 };
56};
57
58#endif /* end of include guard: LEMMA_H_D73105A7 */