parsely-dip 0.0.0__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- parsely_dip-0.0.0/PKG-INFO +80 -0
- parsely_dip-0.0.0/README.md +66 -0
- parsely_dip-0.0.0/pyproject.toml +23 -0
- parsely_dip-0.0.0/setup.cfg +4 -0
- parsely_dip-0.0.0/src/parsely_dip/__init__.py +3 -0
- parsely_dip-0.0.0/src/parsely_dip/cli/__init__.py +0 -0
- parsely_dip-0.0.0/src/parsely_dip/engine/__init__.py +0 -0
- parsely_dip-0.0.0/src/parsely_dip/intents/__init__.py +0 -0
- parsely_dip-0.0.0/src/parsely_dip.egg-info/PKG-INFO +80 -0
- parsely_dip-0.0.0/src/parsely_dip.egg-info/SOURCES.txt +10 -0
- parsely_dip-0.0.0/src/parsely_dip.egg-info/dependency_links.txt +1 -0
- parsely_dip-0.0.0/src/parsely_dip.egg-info/top_level.txt +1 -0
|
@@ -0,0 +1,80 @@
|
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
|
+
Name: parsely-dip
|
|
3
|
+
Version: 0.0.0
|
|
4
|
+
Summary: PARSELY-DIP: Deterministic Intent Parser — RegEx and NLP pipeline for intent recognition
|
|
5
|
+
Author-email: George Butiri <george@iseestudios.com>
|
|
6
|
+
License-Expression: MIT
|
|
7
|
+
Project-URL: Homepage, https://github.com/gbutiri/parsely-dip
|
|
8
|
+
Keywords: nlp,intent,parser,deterministic,regex
|
|
9
|
+
Classifier: Development Status :: 1 - Planning
|
|
10
|
+
Classifier: Programming Language :: Python :: 3
|
|
11
|
+
Classifier: Topic :: Text Processing :: Linguistic
|
|
12
|
+
Requires-Python: >=3.9
|
|
13
|
+
Description-Content-Type: text/markdown
|
|
14
|
+
|
|
15
|
+
# PARSELY-DIP
|
|
16
|
+
|
|
17
|
+
**Parsing And RegEx Syntactic Engine with Linguistic Yield — Deterministic Intent Parser**
|
|
18
|
+
|
|
19
|
+
*Parsely dip for silicon chips.*
|
|
20
|
+
|
|
21
|
+
## What It Does
|
|
22
|
+
|
|
23
|
+
PARSELY-DIP is a deterministic intent recognition engine. It processes natural language input through a cascading pipeline that resolves commands without an LLM whenever possible.
|
|
24
|
+
|
|
25
|
+
**Pipeline:** RegEx > Constituency + Dependency Parsing (Stanza) > LLM Fallback
|
|
26
|
+
|
|
27
|
+
Each layer only fires if the one above didn't match. The cheapest, fastest layer runs first. The LLM is the last resort, not the default.
|
|
28
|
+
|
|
29
|
+
## Why It Exists
|
|
30
|
+
|
|
31
|
+
LLMs are expensive, slow, and unpredictable. When a user says "what time is it" or "move the card to done," there is zero ambiguity. A regex can handle it in microseconds. An LLM spends tokens guessing what you already know.
|
|
32
|
+
|
|
33
|
+
PARSELY-DIP intercepts deterministic commands before they reach the LLM, executes them directly, and returns the result. The LLM only gets involved when the input is genuinely ambiguous.
|
|
34
|
+
|
|
35
|
+
## Architecture
|
|
36
|
+
|
|
37
|
+
### Three-Tier Pipeline
|
|
38
|
+
|
|
39
|
+
1. **RegEx Layer** — Pattern matching for known command structures. Fastest, cheapest, zero dependencies. Handles explicit commands and simple queries.
|
|
40
|
+
|
|
41
|
+
2. **NLP Layer** — Stanza constituency and dependency parsing. Matches grammatical structure, not exact strings. Handles natural phrasing variations ("what's the time" vs "what time is it" vs "tell me the time").
|
|
42
|
+
|
|
43
|
+
3. **LLM Fallback** — Only fires when neither deterministic layer can resolve the input. The input arrives with parsed metadata attached, so the LLM has structural context to work with.
|
|
44
|
+
|
|
45
|
+
### Intent Libraries
|
|
46
|
+
|
|
47
|
+
Intent handlers are sideloadable — drop a folder into `intents/` to add new capabilities:
|
|
48
|
+
|
|
49
|
+
- Each library contains regex patterns, NLP patterns, and handler functions
|
|
50
|
+
- Libraries are self-registering via decorators
|
|
51
|
+
- Base examples: time telling, weather, scrum card operations
|
|
52
|
+
|
|
53
|
+
### Integration
|
|
54
|
+
|
|
55
|
+
Designed to run as a Claude Code `UserPromptSubmit` hook. The hook intercepts the user's message, runs it through the pipeline, and either:
|
|
56
|
+
- **Handles it** — executes the command, returns the result
|
|
57
|
+
- **Passes through** — no match, the LLM processes it normally
|
|
58
|
+
|
|
59
|
+
## Pattern Convention
|
|
60
|
+
|
|
61
|
+
RegEx patterns use leading `\s+` before words, not trailing:
|
|
62
|
+
|
|
63
|
+
```
|
|
64
|
+
CORRECT: (what('s|\s+is)\s+the\s+time|what\s+time\s+is\s+it)
|
|
65
|
+
WRONG: (what('s|is\s+)the\s+time\s+|what\s+time\s+is\s+it\s+)
|
|
66
|
+
```
|
|
67
|
+
|
|
68
|
+
The space belongs to the approach of the next word, not trailing from the previous.
|
|
69
|
+
|
|
70
|
+
## Status
|
|
71
|
+
|
|
72
|
+
v0.0.0 — Package name placeholder. Development starting.
|
|
73
|
+
|
|
74
|
+
## License
|
|
75
|
+
|
|
76
|
+
Source-available. Personal and development use permitted.
|
|
77
|
+
|
|
78
|
+
## Author
|
|
79
|
+
|
|
80
|
+
George Butiri — [george@iseestudios.com](mailto:george@iseestudios.com)
|
|
@@ -0,0 +1,66 @@
|
|
|
1
|
+
# PARSELY-DIP
|
|
2
|
+
|
|
3
|
+
**Parsing And RegEx Syntactic Engine with Linguistic Yield — Deterministic Intent Parser**
|
|
4
|
+
|
|
5
|
+
*Parsely dip for silicon chips.*
|
|
6
|
+
|
|
7
|
+
## What It Does
|
|
8
|
+
|
|
9
|
+
PARSELY-DIP is a deterministic intent recognition engine. It processes natural language input through a cascading pipeline that resolves commands without an LLM whenever possible.
|
|
10
|
+
|
|
11
|
+
**Pipeline:** RegEx > Constituency + Dependency Parsing (Stanza) > LLM Fallback
|
|
12
|
+
|
|
13
|
+
Each layer only fires if the one above didn't match. The cheapest, fastest layer runs first. The LLM is the last resort, not the default.
|
|
14
|
+
|
|
15
|
+
## Why It Exists
|
|
16
|
+
|
|
17
|
+
LLMs are expensive, slow, and unpredictable. When a user says "what time is it" or "move the card to done," there is zero ambiguity. A regex can handle it in microseconds. An LLM spends tokens guessing what you already know.
|
|
18
|
+
|
|
19
|
+
PARSELY-DIP intercepts deterministic commands before they reach the LLM, executes them directly, and returns the result. The LLM only gets involved when the input is genuinely ambiguous.
|
|
20
|
+
|
|
21
|
+
## Architecture
|
|
22
|
+
|
|
23
|
+
### Three-Tier Pipeline
|
|
24
|
+
|
|
25
|
+
1. **RegEx Layer** — Pattern matching for known command structures. Fastest, cheapest, zero dependencies. Handles explicit commands and simple queries.
|
|
26
|
+
|
|
27
|
+
2. **NLP Layer** — Stanza constituency and dependency parsing. Matches grammatical structure, not exact strings. Handles natural phrasing variations ("what's the time" vs "what time is it" vs "tell me the time").
|
|
28
|
+
|
|
29
|
+
3. **LLM Fallback** — Only fires when neither deterministic layer can resolve the input. The input arrives with parsed metadata attached, so the LLM has structural context to work with.
|
|
30
|
+
|
|
31
|
+
### Intent Libraries
|
|
32
|
+
|
|
33
|
+
Intent handlers are sideloadable — drop a folder into `intents/` to add new capabilities:
|
|
34
|
+
|
|
35
|
+
- Each library contains regex patterns, NLP patterns, and handler functions
|
|
36
|
+
- Libraries are self-registering via decorators
|
|
37
|
+
- Base examples: time telling, weather, scrum card operations
|
|
38
|
+
|
|
39
|
+
### Integration
|
|
40
|
+
|
|
41
|
+
Designed to run as a Claude Code `UserPromptSubmit` hook. The hook intercepts the user's message, runs it through the pipeline, and either:
|
|
42
|
+
- **Handles it** — executes the command, returns the result
|
|
43
|
+
- **Passes through** — no match, the LLM processes it normally
|
|
44
|
+
|
|
45
|
+
## Pattern Convention
|
|
46
|
+
|
|
47
|
+
RegEx patterns use leading `\s+` before words, not trailing:
|
|
48
|
+
|
|
49
|
+
```
|
|
50
|
+
CORRECT: (what('s|\s+is)\s+the\s+time|what\s+time\s+is\s+it)
|
|
51
|
+
WRONG: (what('s|is\s+)the\s+time\s+|what\s+time\s+is\s+it\s+)
|
|
52
|
+
```
|
|
53
|
+
|
|
54
|
+
The space belongs to the approach of the next word, not trailing from the previous.
|
|
55
|
+
|
|
56
|
+
## Status
|
|
57
|
+
|
|
58
|
+
v0.0.0 — Package name placeholder. Development starting.
|
|
59
|
+
|
|
60
|
+
## License
|
|
61
|
+
|
|
62
|
+
Source-available. Personal and development use permitted.
|
|
63
|
+
|
|
64
|
+
## Author
|
|
65
|
+
|
|
66
|
+
George Butiri — [george@iseestudios.com](mailto:george@iseestudios.com)
|
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
[build-system]
|
|
2
|
+
requires = ["setuptools>=61.0"]
|
|
3
|
+
build-backend = "setuptools.build_meta"
|
|
4
|
+
|
|
5
|
+
[project]
|
|
6
|
+
name = "parsely-dip"
|
|
7
|
+
version = "0.0.0"
|
|
8
|
+
description = "PARSELY-DIP: Deterministic Intent Parser — RegEx and NLP pipeline for intent recognition"
|
|
9
|
+
readme = "README.md"
|
|
10
|
+
license = "MIT"
|
|
11
|
+
requires-python = ">=3.9"
|
|
12
|
+
authors = [
|
|
13
|
+
{name = "George Butiri", email = "george@iseestudios.com"}
|
|
14
|
+
]
|
|
15
|
+
keywords = ["nlp", "intent", "parser", "deterministic", "regex"]
|
|
16
|
+
classifiers = [
|
|
17
|
+
"Development Status :: 1 - Planning",
|
|
18
|
+
"Programming Language :: Python :: 3",
|
|
19
|
+
"Topic :: Text Processing :: Linguistic",
|
|
20
|
+
]
|
|
21
|
+
|
|
22
|
+
[project.urls]
|
|
23
|
+
Homepage = "https://github.com/gbutiri/parsely-dip"
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
@@ -0,0 +1,80 @@
|
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
|
+
Name: parsely-dip
|
|
3
|
+
Version: 0.0.0
|
|
4
|
+
Summary: PARSELY-DIP: Deterministic Intent Parser — RegEx and NLP pipeline for intent recognition
|
|
5
|
+
Author-email: George Butiri <george@iseestudios.com>
|
|
6
|
+
License-Expression: MIT
|
|
7
|
+
Project-URL: Homepage, https://github.com/gbutiri/parsely-dip
|
|
8
|
+
Keywords: nlp,intent,parser,deterministic,regex
|
|
9
|
+
Classifier: Development Status :: 1 - Planning
|
|
10
|
+
Classifier: Programming Language :: Python :: 3
|
|
11
|
+
Classifier: Topic :: Text Processing :: Linguistic
|
|
12
|
+
Requires-Python: >=3.9
|
|
13
|
+
Description-Content-Type: text/markdown
|
|
14
|
+
|
|
15
|
+
# PARSELY-DIP
|
|
16
|
+
|
|
17
|
+
**Parsing And RegEx Syntactic Engine with Linguistic Yield — Deterministic Intent Parser**
|
|
18
|
+
|
|
19
|
+
*Parsely dip for silicon chips.*
|
|
20
|
+
|
|
21
|
+
## What It Does
|
|
22
|
+
|
|
23
|
+
PARSELY-DIP is a deterministic intent recognition engine. It processes natural language input through a cascading pipeline that resolves commands without an LLM whenever possible.
|
|
24
|
+
|
|
25
|
+
**Pipeline:** RegEx > Constituency + Dependency Parsing (Stanza) > LLM Fallback
|
|
26
|
+
|
|
27
|
+
Each layer only fires if the one above didn't match. The cheapest, fastest layer runs first. The LLM is the last resort, not the default.
|
|
28
|
+
|
|
29
|
+
## Why It Exists
|
|
30
|
+
|
|
31
|
+
LLMs are expensive, slow, and unpredictable. When a user says "what time is it" or "move the card to done," there is zero ambiguity. A regex can handle it in microseconds. An LLM spends tokens guessing what you already know.
|
|
32
|
+
|
|
33
|
+
PARSELY-DIP intercepts deterministic commands before they reach the LLM, executes them directly, and returns the result. The LLM only gets involved when the input is genuinely ambiguous.
|
|
34
|
+
|
|
35
|
+
## Architecture
|
|
36
|
+
|
|
37
|
+
### Three-Tier Pipeline
|
|
38
|
+
|
|
39
|
+
1. **RegEx Layer** — Pattern matching for known command structures. Fastest, cheapest, zero dependencies. Handles explicit commands and simple queries.
|
|
40
|
+
|
|
41
|
+
2. **NLP Layer** — Stanza constituency and dependency parsing. Matches grammatical structure, not exact strings. Handles natural phrasing variations ("what's the time" vs "what time is it" vs "tell me the time").
|
|
42
|
+
|
|
43
|
+
3. **LLM Fallback** — Only fires when neither deterministic layer can resolve the input. The input arrives with parsed metadata attached, so the LLM has structural context to work with.
|
|
44
|
+
|
|
45
|
+
### Intent Libraries
|
|
46
|
+
|
|
47
|
+
Intent handlers are sideloadable — drop a folder into `intents/` to add new capabilities:
|
|
48
|
+
|
|
49
|
+
- Each library contains regex patterns, NLP patterns, and handler functions
|
|
50
|
+
- Libraries are self-registering via decorators
|
|
51
|
+
- Base examples: time telling, weather, scrum card operations
|
|
52
|
+
|
|
53
|
+
### Integration
|
|
54
|
+
|
|
55
|
+
Designed to run as a Claude Code `UserPromptSubmit` hook. The hook intercepts the user's message, runs it through the pipeline, and either:
|
|
56
|
+
- **Handles it** — executes the command, returns the result
|
|
57
|
+
- **Passes through** — no match, the LLM processes it normally
|
|
58
|
+
|
|
59
|
+
## Pattern Convention
|
|
60
|
+
|
|
61
|
+
RegEx patterns use leading `\s+` before words, not trailing:
|
|
62
|
+
|
|
63
|
+
```
|
|
64
|
+
CORRECT: (what('s|\s+is)\s+the\s+time|what\s+time\s+is\s+it)
|
|
65
|
+
WRONG: (what('s|is\s+)the\s+time\s+|what\s+time\s+is\s+it\s+)
|
|
66
|
+
```
|
|
67
|
+
|
|
68
|
+
The space belongs to the approach of the next word, not trailing from the previous.
|
|
69
|
+
|
|
70
|
+
## Status
|
|
71
|
+
|
|
72
|
+
v0.0.0 — Package name placeholder. Development starting.
|
|
73
|
+
|
|
74
|
+
## License
|
|
75
|
+
|
|
76
|
+
Source-available. Personal and development use permitted.
|
|
77
|
+
|
|
78
|
+
## Author
|
|
79
|
+
|
|
80
|
+
George Butiri — [george@iseestudios.com](mailto:george@iseestudios.com)
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
README.md
|
|
2
|
+
pyproject.toml
|
|
3
|
+
src/parsely_dip/__init__.py
|
|
4
|
+
src/parsely_dip.egg-info/PKG-INFO
|
|
5
|
+
src/parsely_dip.egg-info/SOURCES.txt
|
|
6
|
+
src/parsely_dip.egg-info/dependency_links.txt
|
|
7
|
+
src/parsely_dip.egg-info/top_level.txt
|
|
8
|
+
src/parsely_dip/cli/__init__.py
|
|
9
|
+
src/parsely_dip/engine/__init__.py
|
|
10
|
+
src/parsely_dip/intents/__init__.py
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
parsely_dip
|