-
Notifications
You must be signed in to change notification settings - Fork 58
Expand file tree
/
Copy pathtext_splitters.py
More file actions
193 lines (148 loc) · 5.51 KB
/
text_splitters.py
File metadata and controls
193 lines (148 loc) · 5.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
"""
Text Splitters and Chunking Strategies
Optimizing document chunks for RAG
"""
from langchain_text_splitters import (
RecursiveCharacterTextSplitter,
CharacterTextSplitter,
TokenTextSplitter,
MarkdownHeaderTextSplitter,
Language,
)
from langchain_core.documents import Document
from dotenv import load_dotenv
load_dotenv()
# Sample documents for testing
SAMPLE_TEXT = """# Introduction to Machine Learning
Machine learning is a subset of artificial intelligence that enables systems to learn and improve from experience without being explicitly programmed.
## Types of Machine Learning
### Supervised Learning
Supervised learning uses labeled data to train models. The algorithm learns to map inputs to outputs based on example input-output pairs.
Common algorithms include:
- Linear Regression
- Decision Trees
- Neural Networks
### Unsupervised Learning
Unsupervised learning finds hidden patterns in unlabeled data. The algorithm discovers structure without predefined labels.
Common algorithms include:
- K-Means Clustering
- Principal Component Analysis
- Autoencoders
## Applications
Machine learning is used in many fields:
1. Image recognition
2. Natural language processing
3. Recommendation systems
4. Fraud detection
5. Autonomous vehicles
""".strip()
SAMPLE_CODE = '''
def quicksort(arr):
"""
Quicksort implementation in Python.
Time complexity: O(n log n) average, O(n²) worst case.
"""
if len(arr) <= 1:
return arr
pivot = arr[len(arr) // 2]
left = [x for x in arr if x < pivot]
middle = [x for x in arr if x == pivot]
right = [x for x in arr if x > pivot]
return quicksort(left) + middle + quicksort(right)
def binary_search(arr, target):
"""
Binary search implementation.
Requires sorted array.
Time complexity: O(log n)
"""
left, right = 0, len(arr) - 1
while left <= right:
mid = (left + right) // 2
if arr[mid] == target:
return mid
elif arr[mid] < target:
left = mid + 1
else:
right = mid - 1
return -1
'''
def recursive_splitter():
splitter = RecursiveCharacterTextSplitter(
chunk_size=500,
chunk_overlap=50,
separators=["\n\n", "\n", " ", ""],
)
chunks = splitter.split_text(SAMPLE_TEXT)
print(f"Original length: {len(SAMPLE_TEXT)} chars")
print(f"Number of chunks: {len(chunks)}")
print(f"Chunk sizes: {[len(c) for c in chunks]}")
print(f"\nFirst chunk preview:\n{chunks[0][:200]}...")
def chunk_size_comparison():
sizes = [200, 500, 1000]
print("=== Chunk Size Comparison ===")
for size in sizes:
splitter = RecursiveCharacterTextSplitter(
chunk_size=size, chunk_overlap=size // 5
) # 20% overlap
chunks = splitter.split_text(SAMPLE_TEXT)
print(f" Size {size}: {len(chunks)} chunks")
def overlap_importance():
text = "The quick brown fox jumps over the lazy dog. " * 10 # Repeated text
# without overlap
no_overlap = RecursiveCharacterTextSplitter(chunk_size=50, chunk_overlap=0)
# with overlap
with_overlap = RecursiveCharacterTextSplitter(chunk_size=50, chunk_overlap=20)
chunks_no_overlap = no_overlap.split_text(text)
chunks_with_overlap = with_overlap.split_text(text)
print("Without overlap:")
print(f" Chunk 1 end: ...{chunks_no_overlap[0][-20:]}")
print(f" Chunk 2 start: {chunks_no_overlap[1][:20]}...")
print("\nWith overlap:")
print(f" Chunk 1 end: ...{chunks_with_overlap[0][-20:]}")
print(f" Chunk 2 start: {chunks_with_overlap[1][:20]}...")
def markdown_splitter():
headers_to_consider = [
("#", "h1"),
("##", "h2"),
("###", "h3"),
]
splitter = MarkdownHeaderTextSplitter(headers_to_split_on=headers_to_consider)
chunks = splitter.split_text(SAMPLE_TEXT)
print(f"Markdown Splitter produced {len(chunks)} chunks.")
for i, chunk in enumerate(chunks):
print(f"--- Chunk {i} ---")
print(f" Metadata: {chunk.metadata}\n")
print(f" Content: {chunk.page_content[:200]}...\n")
def code_splitter():
python_splitter = RecursiveCharacterTextSplitter.from_language(
language=Language.PYTHON, chunk_size=500, chunk_overlap=50
)
chunks = python_splitter.split_text(SAMPLE_CODE)
print(f"Code Splitter produced {len(chunks)} chunks.")
for i, chunk in enumerate(chunks):
print(f"\nChunk {i} ({len(chunk)} chars):")
print(chunk[:150] + "..." if len(chunk) > 150 else chunk)
def document_splitter():
from langchain_community.document_loaders import PyPDFLoader
from langchain_core.documents import Document
loader = PyPDFLoader("./docs/langchain_demo.pdf")
docs = loader.load()
print(f"Loaded {len(docs)} documents from PDF.")
splitter = RecursiveCharacterTextSplitter(chunk_size=500, chunk_overlap=50)
# split the docs
split_docs = splitter.split_documents(docs)
print(f"Split into {len(split_docs)} chunks")
print(f"\nFirst chunk metadata: {split_docs[0].metadata}")
print(f"First chunk content: {split_docs[0].page_content[:200]}...")
print(f"\nLast chunk metadata: {split_docs[-1].metadata}")
if __name__ == "__main__":
# print("=== Recursive Character Text Splitter ===")
# recursive_splitter()
# chunk_size_comparison()
# overlap_importance()
# print("=== Markdown Header Text Splitter ===")
# markdown_splitter()
# print("=== Code Splitter ===")
# code_splitter()
print("=== Document Splitter from PDF ===")
document_splitter()